{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T01:02:03Z","timestamp":1760230923910,"version":"build-2065373602"},"reference-count":42,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2022,8,17]],"date-time":"2022-08-17T00:00:00Z","timestamp":1660694400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Shandong Provincial Key Research and Development Program","award":["2020CXGC010107","2019JZZY020129","2020KJC-GH11"],"award-info":[{"award-number":["2020CXGC010107","2019JZZY020129","2020KJC-GH11"]}]},{"name":"Science, Education and Industry Integration Innovation Program of Qilu University of Technology (Shandong Academy of Science)","award":["2020CXGC010107","2019JZZY020129","2020KJC-GH11"],"award-info":[{"award-number":["2020CXGC010107","2019JZZY020129","2020KJC-GH11"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>An instance of the framework for cryptographic security enhancement of symmetric-key encryption employing a dedicated error correction encoding is addressed. The main components of the proposal are: (i) a dedicated error correction coding and (ii) the use of a dedicated simulator of the noisy channel. The proposed error correction coding is designed for the binary erasure channel where at most one bit is erased in each codeword byte. The proposed encryption has been evaluated in the traditional scenario where we consider the advantage of an attacker to correctly decide to which of two known messages the given ciphertext corresponds. The evaluation shows that the proposed encryption provides a reduction of the considered attacker\u2019s advantage in comparison with the initial encryption setting. The implementation complexity of the proposed encryption is considered, and it implies a suitable trade-off between increased security and increased implementation complexity.<\/jats:p>","DOI":"10.3390\/sym14081709","type":"journal-article","created":{"date-parts":[[2022,8,17]],"date-time":"2022-08-17T03:15:27Z","timestamp":1660706127000},"page":"1709","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Security Enhanced Symmetric Key Encryption Employing an Integer Code for the Erasure Channel"],"prefix":"10.3390","volume":"14","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":"Aleksandar","family":"Radonji\u0107","sequence":"additional","affiliation":[{"name":"Institute of Technical Sciences, The Serbian Academy of Science 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,8,17]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Mihaljevi\u0107, M.J., Wang, L., and Xu, S. (2022). An Approach for Security Enhancement of Certain Encryption Schemes Employing Error Correction Coding and Simulated Synchronization Errors. Entropy, 24.","DOI":"10.3390\/e24030406"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Rivest, R., and Sherman, T. (1983). RandomizedEncryption Techniques. Advances in Cryptology: Proceedings of CRYPTO \u201982, Plemum.","DOI":"10.1007\/978-1-4757-0602-4_14"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1109\/TIT.1980.1056136","article-title":"Deliberate noise in a moderncryptographic system","volume":"26","author":"Willett","year":"1980","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_4","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_5","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_6","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_7","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_8","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_9","first-page":"4380","article-title":"Physical Layer Encryption Algorithm Based on Polar Codes and Chaotic Sequences","volume":"4","author":"Lu","year":"2018","journal-title":"IEEE Access"},{"key":"ref_10","first-page":"65","article-title":"Design and implementation of hardwareefficient modified Rao\u2013Nam scheme with high security for wireless sensor networks","volume":"29","author":"Stuart","year":"2016","journal-title":"J. Inf. Secur. Appl."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"An, C., Liu, Y., and Lu, X. (2021, January 7\u201311). Evolution of the Polar Code-Based Encryption Schemes. Proceedings of the 2021 IEEE Globecom Workshops, Madrid, Spain.","DOI":"10.1109\/GCWkshps52748.2021.9681980"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"4673","DOI":"10.1109\/TCOMM.2020.2996781","article-title":"A Joint Encryption, Channel Coding and Modulation Scheme Using QC-LDPC Lattice-Codes","volume":"68","author":"Bagheri","year":"2020","journal-title":"IEEE Trans. Commun."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Hooshmand, R., Shooshtari, M.K., and Aref, M.R. (2013, January 29\u201330). Secret key cryptosystem based on polar codes over Binary Erasure Channel. Proceedings of the 2013 10th International ISC Conference on Information Security and Cryptology (ISCISC), Yazd, Iran.","DOI":"10.1109\/ISCISC.2013.6767351"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Rajagopalan, A., Thangaraj, A., and Agrawal, S. (2018, January 17\u201322). Wiretap Polar Codes in Encryption Schemes Based on Learning with Errors Problem. Proceedings of the 2018 IEEE International Symposium on Information Theory (ISIT), Vail, CO, USA.","DOI":"10.1109\/ISIT.2018.8437896"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1109\/18.32159","article-title":"Private-key algebraic-code encryptions","volume":"35","author":"Rao","year":"1989","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_16","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_17","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_18","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_19","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_20","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_21","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_22","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_23","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Cash, D., Peikert, C., and Sahai, A. (2009, January 16\u201320). Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems. Proceedings of the Annual International Cryptology Conference, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-642-03356-8_35"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/978-3-540-70583-3_55","article-title":"How to Encrypt with the LPN Problem. ICALP 2008, Part II","volume":"5126","author":"Gilbert","year":"2008","journal-title":"Lect. Notes Comput. Sci."},{"key":"ref_25","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_26","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."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1109\/LCOMM.2017.2654238","article-title":"Ciphertext-Only Attack on Linear Feedback Shift Register-Based Esmaeili-Gulliver Cryptosystem","volume":"21","author":"Lee","year":"2017","journal-title":"IEEE Commun. Lett."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"4363","DOI":"10.1109\/TCOMM.2015.2474860","article-title":"Statistical Characterization of Decryption Errors in Block-Ciphered Systems","volume":"63","author":"Wang","year":"2015","journal-title":"IEEE Trans. Commun."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"1230","DOI":"10.1049\/iet-com.2017.0566","article-title":"Security analysis of M-DES and key-based coded permutation ciphers in wireless channels","volume":"12","author":"Yap","year":"2018","journal-title":"IET Commun."},{"key":"ref_30","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_31","doi-asserted-by":"crossref","first-page":"10988","DOI":"10.1109\/TVT.2020.3006369","article-title":"Fast Block Sequential Decoding of Polar Codes","volume":"69","author":"Trofimiuk","year":"2020","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"6284","DOI":"10.1109\/TIT.2016.2608892","article-title":"Novel Polynomial Basis with Fast Fourier Transform and Its Application to Reed\u2013Solomon Erasure Codes","volume":"62","author":"Lin","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/LCOMM.2017.2757465","article-title":"(Perfect) Integer Codes Correcting Single Errors","volume":"22","author":"Radonjic","year":"2018","journal-title":"IEEE Commun. Lett."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1016\/j.jfranklin.2017.11.033","article-title":"Integer Codes Correcting Burst and Random Asymmetric Errors within a Byte","volume":"355","author":"Radonjic","year":"2018","journal-title":"J. Franklin Inst."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1007\/s12095-019-0350-9","article-title":"Integer Codes Correcting Sparse Byte Errors","volume":"11","author":"Radonjic","year":"2019","journal-title":"Cryptogr. Commun."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"1901","DOI":"10.1109\/TVLSI.2020.2998364","article-title":"Integer Codes Correcting Double Errors and Triple-Adjacent Errors within a Byte","volume":"8","author":"Radonjic","year":"2020","journal-title":"IEEE Trans. Very Large Scale Integr. Syst."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Katz, J., and Lindell, Y. (2007). Introduction to Modern Cryptography, CRC Press.","DOI":"10.1201\/9781420010756"},{"key":"ref_38","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_39","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_40","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_41","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_42","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"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/8\/1709\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:10:51Z","timestamp":1760141451000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/8\/1709"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,17]]},"references-count":42,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2022,8]]}},"alternative-id":["sym14081709"],"URL":"https:\/\/doi.org\/10.3390\/sym14081709","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2022,8,17]]}}}