{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:55:21Z","timestamp":1760151321497,"version":"build-2065373602"},"reference-count":24,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Shandong Provincial Key Research and Development Program (2020CXGC010107, 2019JZZY020129), the Science, Education and Industry Integration Innovation Program of Qilu University of Technology (Shandong Academy of Science) (2020KJC-GH11)","award":["2020CXGC010107, 2019JZZY020129"],"award-info":[{"award-number":["2020CXGC010107, 2019JZZY020129"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>An approach for the cryptographic security enhancement of encryption is proposed and analyzed. The enhancement is based on the employment of a coding scheme and degradation of the ciphertext. From the perspective of the legitimate parties that share a secret key, the degradation appears as a transmission of the ciphertext through a binary erasure channel. On the other hand, from the perspective of an attacker the degradation appears as a transmission of the ciphertext over a binary deletion channel. Cryptographic security enhancement is analyzed based on the capacity of the related binary deletion channel. An illustrative implemementation framework is pointed out.<\/jats:p>","DOI":"10.3390\/e24030406","type":"journal-article","created":{"date-parts":[[2022,3,15]],"date-time":"2022-03-15T03:06:10Z","timestamp":1647313570000},"page":"406","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An Approach for Security Enhancement of Certain Encryption Schemes Employing Error Correction Coding and Simulated Synchronization Errors"],"prefix":"10.3390","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3047-3020","authenticated-orcid":false,"given":"Miodrag J.","family":"Mihaljevi\u0107","sequence":"first","affiliation":[{"name":"The Shandong Provincial Key Laboratory of Computer Networks, Qilu University of Technology (Shandong Academy of Sciences), Jinan 250014, China"},{"name":"Mathematical Institute, The Serbian Academy of Sciences and Arts, 11000 Belgrade, Serbia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lianhai","family":"Wang","sequence":"additional","affiliation":[{"name":"The Shandong Provincial Key Laboratory of Computer Networks, Qilu University of Technology (Shandong Academy of Sciences), Jinan 250014, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shujiang","family":"Xu","sequence":"additional","affiliation":[{"name":"The Shandong Provincial Key Laboratory of Computer Networks, Qilu University of Technology (Shandong Academy of Sciences), Jinan 250014, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,3,14]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Rivest, R., and Sherman, T. (1983). Randomized Encryption Techniques. Advances in Cryptology: Proceedings of CRYPTO \u201982, Plemum.","DOI":"10.1007\/978-1-4757-0602-4_14"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1109\/TIT.1980.1056136","article-title":"Deliberate noise in a modern cryptographic system","volume":"26","author":"Willett","year":"1980","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"2556","DOI":"10.1049\/iet-com.2014.0101","article-title":"New secure channel coding scheme based on randomly punctured quasi-cyclic-low density parity check codes","volume":"8","author":"Esmaeili","year":"2014","journal-title":"IET Commun."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1555","DOI":"10.1049\/iet-com.2015.0026","article-title":"Joint channel coding-cryptography based on random insertions and deletions in quasi-cyclic-low-density parity check codes","volume":"9","author":"Esmaeili","year":"2015","journal-title":"IET Commun."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"870","DOI":"10.1109\/LCOMM.2016.2540625","article-title":"A Secure Code Based Cryptosystem via Random Insertions, Deletions, and Errors","volume":"20","author":"Esmaeili","year":"2016","journal-title":"IEEE Commun. Lett."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1857","DOI":"10.1049\/iet-com.2014.0933","article-title":"Physical layer encryption scheme using finite-length polar codes","volume":"9","author":"Hooshmand","year":"2015","journal-title":"IET Commun."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1109\/LWC.2017.2735401","article-title":"Efficient Polar Code-Based Physical Layer Encryption Scheme","volume":"6","author":"Hooshmand","year":"2017","journal-title":"IEEE Wirel. Commun. Lett."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s00607-009-0035-x","article-title":"An approach for stream ciphers design based on joint computing over random and secret data","volume":"85","author":"Imai","year":"2009","journal-title":"Computing"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1604","DOI":"10.1109\/TIFS.2012.2204983","article-title":"Enhancement of Secrecy of Block Ciphered Systems by Deliberate Noise","volume":"7","author":"Khiabani","year":"2012","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Mihaljevi\u0107, M.J. (2012, January 3\u20137). An Approach for Light-Weight Encryption Employing Dedicated Coding. Proceedings of the IEEE Global Communications Conference (GLOBECOM), Anaheim, CA, USA.","DOI":"10.1109\/GLOCOM.2012.6503223"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1109\/TIFS.2013.2248724","article-title":"Trade-Off Between Security and Performance in Block Ciphered Systems with Erroneous Ciphertexts","volume":"8","author":"Wei","year":"2013","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1109\/TIFS.2013.2294763","article-title":"An Information-Theoretic Security Evaluation of a Class of Randomized Encryption Schemes","volume":"9","author":"Oggier","year":"2014","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_13","first-page":"7920495","article-title":"An Encryption Technique for Provably Secure Transmission from a High Performance Computing Entity to a Tiny One","volume":"2016","author":"Matsuura","year":"2016","journal-title":"Math. Probl. Eng."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1049\/iet-ifs.2017.0271","article-title":"Security Evaluation and Design Elements for a Class of Randomized Encryptions","volume":"13","author":"Mihaljevic","year":"2019","journal-title":"IET Inf. Secur."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Mihaljevic, M.J. (2019). A Security Enhanced Encryption Scheme and Evaluation of Its Cryptographic Security. Entropy, 21.","DOI":"10.3390\/e21070701"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1109\/TIT.2014.2368553","article-title":"Upper Bounds on the Capacity of Deletion Channels Using Channel Fragmentation","volume":"61","author":"Rahmati","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1109\/TIT.1968.1054135","article-title":"Uncertainty and the Probability of Error","volume":"IT-24","author":"Tebbe","year":"1968","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1109\/18.272494","article-title":"Relations between entropy and error probability","volume":"40","author":"Feder","year":"1994","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Katz, J., and Lindell, Y. (2007). Introduction to Modern Cryptography, CRC Press.","DOI":"10.1201\/9781420010756"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1109\/18.910575","article-title":"Efficient Erasure Correcting Codes","volume":"47","author":"Luby","year":"2001","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1109\/TIT.2004.824918","article-title":"On Decoding of Low-Density Parity-Check Codes Over the Binary Erasure Channel","volume":"50","author":"Fekri","year":"2004","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Rybin, P., Andreev, K., and Zyablov, V. (2021). Error Exponents of LDPC Codes under Low-Complexity Decoding. Entropy, 23.","DOI":"10.3390\/e23020253"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","article-title":"Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels","volume":"55","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1109\/LCOMM.2017.2650918","article-title":"Polar coding for the binary erasure channel with deletions","volume":"21","author":"Thomas","year":"2017","journal-title":"IEEE Commun. Lett."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/3\/406\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:36:14Z","timestamp":1760135774000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/3\/406"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,14]]},"references-count":24,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2022,3]]}},"alternative-id":["e24030406"],"URL":"https:\/\/doi.org\/10.3390\/e24030406","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2022,3,14]]}}}