{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T03:01:58Z","timestamp":1760151718399,"version":"build-2065373602"},"reference-count":19,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Error-correcting codes form an important topic in information theory. They are used to correct errors that occur during transmission on a noisy channel. An important method for correcting errors is bounded distance decoding. The public-key cryptosystem is a cryptographic protocol that has two different keys. One of them is a public-key that can be known by everyone, and the other is the private-key only known to the user of the system. The data encrypted with the public-key of a given user can only be decrypted by this user with his or her private-key. In this paper, we propose a public-key cryptosystem based on the error-correcting codes. The decryption is performed by using the bounded distance decoding of the code. For a given code length, dimension, and error-correcting capacity, the new system allows dealing with larger plaintext than other code based public-key cryptosystems.<\/jats:p>","DOI":"10.3390\/e24040498","type":"journal-article","created":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T21:22:39Z","timestamp":1648848159000},"page":"498","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Public-Key Cryptosystems and Bounded Distance Decoding of Linear Codes"],"prefix":"10.3390","volume":"24","author":[{"given":"Selda","family":"\u00c7alkavur","sequence":"first","affiliation":[{"name":"Math Department, Faculty of Arts and Science, Kocaeli University, Kocaeli 41380, Turkey"}]}],"member":"1968","published-online":{"date-parts":[[2022,4,1]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10559-016-9809-2","article-title":"A Method for arithmetic comparison of data represented in a residue number system","volume":"52","author":"Krasnobayev","year":"2016","journal-title":"Cybern. Syst. Anal."},{"key":"ref_2","unstructured":"Menezes, A.J., van Oorschot, P.C., and Vanstone, S.A. (1997). Handbook of Applied Cryptography, CRC Press."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","article-title":"New Directions in Cryptography","volume":"IT-22","author":"Diffie","year":"1976","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1145\/357980.358017","article-title":"A method for obtaining digital signatures and public-key cryptosystems","volume":"26","author":"Rivest","year":"1978","journal-title":"Commun. ACM"},{"key":"ref_5","unstructured":"Markku-Juhani, O. (2007, January 9\u201313). Saarinen, Linearization attacks against syndrome based hashes. Proceedings of the 8th International Conference on Cryptology in India, Chennai, India."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","article-title":"Hiding information and signatures in trapdoor kanpsacks","volume":"24","author":"Merkle","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_7","unstructured":"McEliece, R.J. (1978). A Public-Key Cryptosystem Based on Algebraic Coding Theory, Jet Propulsion Labaratory. DSN Progress Report."},{"key":"ref_8","first-page":"19","article-title":"Knapsack-type cryptosystems and algebraic coding theory","volume":"15","author":"Niederreiter","year":"1986","journal-title":"Probl. Control. Inf. Theory"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1109\/18.272496","article-title":"On the equivalence of mceeliece\u2019s and niederreiter\u2019s public-key cryptosystems","volume":"40","author":"Li","year":"1994","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"2588","DOI":"10.1109\/TIT.2020.2967047","article-title":"On the Bounded Distance Decoding Problem for Lattices Constructed and Their Cryptographic Applications","volume":"66","author":"Li","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10623-003-6151-2","article-title":"How to mask the structure of codes for a cryptographic use","volume":"35","author":"Berger","year":"2005","journal-title":"Des. Codes Cryptogr."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","article-title":"On the inherent intractability of certain coding problems (corresp.)","volume":"24","author":"Berlekamp","year":"1978","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_13","unstructured":"Krouk, E. (1997, January 11\u201315). A New Public-Key Cryptosystem. Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques, Konstanz, Germany."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1515\/dma.1994.4.3.191","article-title":"A public-key cryptosystem based on binary reed-muller codes","volume":"4","author":"Sidelnikov","year":"1994","journal-title":"Discret. Math. Appl."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Berger, T.P., Cayrel, P.-L., Gaborit, P., and Otmani, A. (2009, January 21\u201325). Reducing key length of the mceliece cryptosystem. Proceedings of the Second International Conference on Cryptology in Africa, Gammarth, Tunisia.","DOI":"10.1007\/978-3-642-02384-2_6"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Misoczki, R., and Barreto, P. (2009). Compact mceliece keys from goppa codes. Selected Areas in Cryptography, Springer.","DOI":"10.1007\/978-3-642-05445-7_24"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1109\/18.651067","article-title":"A new algorithm for finding minimum-weight words in a linear code: Application to McEliece cyptosystem and to narrow-sense BCH codes of length 511","volume":"44","author":"Canteaut","year":"1998","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_18","unstructured":"Hill, R. (1986). A First Course in Coding Theory, Oxford University."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"V\u00e9ron, P. (2013, January 3\u20136). Code based cryptography and steganography. Proceedings of the 5th International Conference, CAI 2013, Porquerolles, France.","DOI":"10.1007\/978-3-642-40663-8_5"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/4\/498\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:48:42Z","timestamp":1760136522000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/4\/498"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,1]]},"references-count":19,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2022,4]]}},"alternative-id":["e24040498"],"URL":"https:\/\/doi.org\/10.3390\/e24040498","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2022,4,1]]}}}