{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T16:56:27Z","timestamp":1774976187608,"version":"3.50.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,8,15]],"date-time":"2014-08-15T00:00:00Z","timestamp":1408060800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s00145-014-9187-8","type":"journal-article","created":{"date-parts":[[2014,8,14]],"date-time":"2014-08-14T16:51:09Z","timestamp":1408035069000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":63,"title":["Enhanced Public Key Security for the McEliece Cryptosystem"],"prefix":"10.1007","volume":"29","author":[{"given":"Marco","family":"Baldi","sequence":"first","affiliation":[]},{"given":"Marco","family":"Bianchi","sequence":"additional","affiliation":[]},{"given":"Franco","family":"Chiaraluce","sequence":"additional","affiliation":[]},{"given":"Joachim","family":"Rosenthal","sequence":"additional","affiliation":[]},{"given":"Davide","family":"Schipani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,15]]},"reference":[{"key":"9187_CR1","doi-asserted-by":"crossref","unstructured":"M. Baldi, M. Bianchi, F. Chiaraluce, Optimization of the parity-check matrix density in QC-LDPC code-based McEliece cryptosystems, in Proceedings of the IEEE International Conference on Communications (ICC 2013) - Workshop on Information Security over Noisy and Lossy Communication Systems. (Budapest, Hungary 2013)","DOI":"10.1109\/ICCW.2013.6649325"},{"key":"9187_CR2","doi-asserted-by":"crossref","unstructured":"M. Baldi, M. Bianchi, F. Chiaraluce, Security and complexity of the McEliece Cryptosystem based on QC-LDPC codes. IET Inf. Secur.\u00a07(3), 212\u2013220 (2013)","DOI":"10.1049\/iet-ifs.2012.0127"},{"key":"9187_CR3","doi-asserted-by":"crossref","unstructured":"M. Baldi, M. Bianchi, N. Maturo, F. Chiaraluce, Improving the efficiency of the LDPC code-based McEliece cryptosystem through irregular codes, in Proceedings of the IEEE Symposium on Computers and Communications (ISCC 2013). (Split, Croatia, 2013)","DOI":"10.1109\/ISCC.2013.6754945"},{"key":"9187_CR4","doi-asserted-by":"crossref","unstructured":"M. Baldi, M. Bodrato, F. Chiaraluce, A new analysis of the McEliece cryptosystem based on QC-LDPC codes, in Security and Cryptography for Networks. LNCS, vol. 5229 (Springer, Berlin\/Heidelberg, 2008), pp. 246\u2013262","DOI":"10.1007\/978-3-540-85855-3_17"},{"key":"9187_CR5","doi-asserted-by":"crossref","unstructured":"M. Baldi, F. Chiaraluce, Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC codes, in Proceedings of the IEEE International Symposium on Information Theory (ISIT 2007) (Nice, France, 2007), pp. 2591\u20132595","DOI":"10.1109\/ISIT.2007.4557609"},{"key":"9187_CR6","doi-asserted-by":"crossref","unstructured":"M. Baldi, F. Chiaraluce, R. Garello, F. Mininni, Quasi-cyclic low-density parity-check codes in the McEliece cryptosystem, in Proceedings of the IEEE International Conference on Communications (ICC 2007) (Glasgow, Scotland, 2007), pp. 951\u2013956","DOI":"10.1109\/ICC.2007.161"},{"key":"9187_CR7","doi-asserted-by":"crossref","unstructured":"A. Becker, A. Joux, A. May, A. Meurer, Decoding random binary linear codes in $$2^{n\/20}$$ 2 n \/ 20 : How 1 + 1 = 0 improves information set decoding, in EUROCRYPT 2012. LNCS, vol. 7237 (Springer-Verlag 2012), pp. 520\u2013536","DOI":"10.1007\/978-3-642-29011-4_31"},{"key":"9187_CR8","unstructured":"T.P. Berger, P. Loidreau, How to mask the structure of codes for a cryptographic use. Des. Codes Cryptogr. 35, 63\u201379 (2005)"},{"key":"9187_CR9","doi-asserted-by":"crossref","unstructured":"E. Berlekamp, R. McEliece, H. van Tilborg, On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory 24(3), 384\u2013386 (1978)","DOI":"10.1109\/TIT.1978.1055873"},{"key":"9187_CR10","doi-asserted-by":"crossref","unstructured":"D.J. Bernstein, T. Chou, P. Schwabe, McBits: fast constant-time code-based cryptography, in Proceedings of the Cryptographic Hardware and Embedded Systems (CHES 2013). LNCS, vol. 8086 (Springer, 2013), pp. 250\u2013272","DOI":"10.1007\/978-3-642-40349-1_15"},{"key":"9187_CR11","doi-asserted-by":"crossref","unstructured":"D.J. Bernstein, T. Lange, C. Peters, Attacking and defending the McEliece cryptosystem, in Post-Quantum Cryptography. LNCS, vol. 5299 (Springer, Berlin\/Heidelberg, 2008), pp. 31\u201346","DOI":"10.1007\/978-3-540-88403-3_3"},{"key":"9187_CR12","doi-asserted-by":"crossref","unstructured":"D.J. Bernstein, T. Lange, C. Peters, Smaller decoding exponents: ball-collision decoding, in CRYPTO 2011. LNCS, vol. 6841 (Springer-Verlag, 2011), pp. 743\u2013760","DOI":"10.1007\/978-3-642-22792-9_42"},{"key":"9187_CR13","doi-asserted-by":"crossref","unstructured":"D.J. Bernstein, T. Lange, C. Peters, Wild McEliece incognito. In: B.-Y. Yang (ed.) Post-Quantum Cryptography: PQCrypto 2011. LNCS, vol. 7071 (Springer 2011), pp. 244\u2013254","DOI":"10.1007\/978-3-642-25405-5_16"},{"key":"9187_CR14","unstructured":"A. Canteaut, Attaques de cryptosystemes a mots de poids faible et construction de fonction t-resilentes. PhD Thesis, Universit\u00e8 Paris (1996)"},{"key":"9187_CR15","doi-asserted-by":"crossref","unstructured":"N. Chen, Z. Yan, Complexity analysis of Reed-Solomon decoding over $$GF(2^m)$$ G F ( 2 m ) without using syndromes. EURASIP J. Wirel. Commun. Netw. Article ID 843634 (2008)","DOI":"10.1155\/2008\/843634"},{"key":"9187_CR16","doi-asserted-by":"crossref","unstructured":"N. Courtois, M. Finiasz, N. Sendrier, How to achieve a McEliece-based digital signature scheme, in ASIACRYPT 2001. LNCS, vol. 2248 (Springer, Berlin\/Heidelberg, 2001), pp. 157\u2013174","DOI":"10.1007\/3-540-45682-1_10"},{"key":"9187_CR17","doi-asserted-by":"publisher","unstructured":"A. Couvreur, P. Gaborit, V. Gauthier-Uma\u00f1a, A. Otmani, J.-P. Tillich, Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes. Des. Codes Cryptogr. (2014). doi: 10.1007\/s10623-014-9967-z","DOI":"10.1007\/s10623-014-9967-z"},{"key":"9187_CR18","doi-asserted-by":"crossref","unstructured":"N. D\u00f6ttling, R. Dowsley, J. M\u00fcller-Quade, A.C.A Nascimento, A CCA2 Secure Variant of the McEliece Cryptosystem. IEEE Trans. Inf. Theory 58(10), 6672\u20136680 (2012)","DOI":"10.1109\/TIT.2012.2203582"},{"key":"9187_CR19","doi-asserted-by":"crossref","unstructured":"R. Dowsley, J. M\u00fcller-Quade, A.C.A. Nascimento, A CCA2 secure public key encryption scheme based on the McEliece assumptions in the standard model, in Topics in Cryptology - CT-RSA 2009. LNCS, vol. 5473 (Springer, Berlin\/Heidelberg, 2009), pp. 240\u2013251","DOI":"10.1007\/978-3-642-00862-7_16"},{"key":"9187_CR20","doi-asserted-by":"crossref","unstructured":"M. Elia, J. Rosenthal, D. Schipani, Polynomial evaluation over finite fields: new algorithms and complexity bounds. Appl. Algebra Eng. Commun. Comput. 23(3\u20134), 129\u2013141 (2011)","DOI":"10.1007\/s00200-011-0160-6"},{"key":"9187_CR21","doi-asserted-by":"crossref","unstructured":"J.-C. Faug\u00e8re, A. Otmani, L. Perret, J.-P. Tillich, A distinguisher for high rate McEliece cryptosystems, in Proceedings of the IEEE Information Theory Workshop (ITW 2011). (Paraty, Brazil, 2011), pp. 282\u2013286","DOI":"10.1109\/ITW.2011.6089437"},{"key":"9187_CR22","doi-asserted-by":"crossref","unstructured":"E. Fujisaki, T. Okamoto, Secure integration of asymmetric and symmetric encryption schemes, in CRYPTO \u201999: Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology. LNCS, vol. 6110 (Springer-Verlag 1999), pp. 537\u2013554","DOI":"10.1007\/3-540-48405-1_34"},{"key":"9187_CR23","unstructured":"E.M. Gabidulin, A.V. Paramonov, O.V. Tretjakov, Ideals over a non-commutative ring and their application in cryptography, in D.W. Davies (ed.) Advances in Cryptology - EUROCRYPT 91. LNCS, vol. 547 (Springer Verlag, 1991)"},{"key":"9187_CR24","doi-asserted-by":"crossref","unstructured":"E.M. Gabidulin, O. Kjelsen, How to avoid the Sidelnikov-Shestakov attack, in Error Control, Cryptology, and Speech Compression. LNCS, vol. 829 (Springer, Berlin\/Heidelberg 1994), pp. 25\u201332","DOI":"10.1007\/3-540-58265-7_4"},{"key":"9187_CR25","unstructured":"V. Gauthier-Uma\u00f1a, A. Otmani, J.-P. Tillich, A distinguisher-based attack on a variant of McEliece\u2019s cryptosystem based on Reed-Solomon codes. http:\/\/arxiv.org\/abs\/1204.6459"},{"key":"9187_CR26","unstructured":"Y. Hamdaoui, N. Sendrier, A non asymptotic analysis of information set decoding. Cryptology ePrint Archive, Report 2013\/162 (2013)"},{"key":"9187_CR27","doi-asserted-by":"crossref","unstructured":"G. Kabatiansky, E. Krouk, S. Semenov, Error Correcting Coding and Security for Data Networks: Analysis of the Superchannel Concept. (Wiley, 2005)","DOI":"10.1002\/0470867574"},{"key":"9187_CR28","doi-asserted-by":"crossref","unstructured":"K. Kobara, H. Imai, Semantically secure McEliece public-key cryptosystems - conversions for McEliece PKC. In: K. Kwangjo, (ed.) Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptosystems (PKC 2001). LNCS, vol. 1992 (Springer, 2001), pp. 19\u201335","DOI":"10.1007\/3-540-44586-2_2"},{"key":"9187_CR29","unstructured":"I. Marquez-Corbella, R. Pellikaan, Error-correcting pairs for a public-key cryptosystem, in Proceedings of the Code-based Cryptography Workshop (CBC 2012) (Lyngby, Denmark, 2012)"},{"key":"9187_CR30","doi-asserted-by":"crossref","unstructured":"A. May, A., Meurer, E. Thomae, Decoding random linear codes in $$O(2^{0.054n})$$ O ( 2 0.054 n ) , in ASIACRYPT 2011. LNCS, vol. 7073 (Springer-Verlag, 2011), pp. 107\u2013124","DOI":"10.1007\/978-3-642-25385-0_6"},{"key":"9187_CR31","unstructured":"R.J. McEliece, A public-key cryptosystem based on algebraic coding theory. DSN Progress Report, 114\u2013116 (1978)"},{"key":"9187_CR32","unstructured":"L. Minder, Cryptography based on error correcting codes. Ph.D. thesis, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (2007)"},{"key":"9187_CR33","doi-asserted-by":"crossref","unstructured":"R. Misoczki, J.-P. Tillich, N. Sendrier, P.S.L.M. Barreto, MDPC-McEliece: New McEliece variants from moderate density parity-check codes. Cryptology ePrint Archive, Report 2012\/409 (2012)","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"9187_CR34","doi-asserted-by":"crossref","unstructured":"C. Monico, J. Rosenthal, A. Shokrollahi, Using low density parity check codes in the McEliece cryptosystem, in Proceedings of the IEEE International Symposium on Information Theory (ISIT 2000) (Sorrento, Italy, 2000), p. 215","DOI":"10.1109\/ISIT.2000.866513"},{"key":"9187_CR35","unstructured":"H. Niederreiter, Knapsack-type cryptosystems and algebraic coding theory. Probl. Contr. Inf. Theory\u00a015, 159\u2013166 (1986)"},{"key":"9187_CR36","unstructured":"A. Otmani, J.P. Tillich, L. Dallot, Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes, in Proceedings of the First International Conference on Symbolic Computation and Cryptography (SCC 2008) (Beijing, China, 2008)"},{"key":"9187_CR37","doi-asserted-by":"crossref","unstructured":"A. Ourivski, E.M. Gabidulin, Column scrambler for the GPT cryptosystem. Discret. Appl. Math. 128, 207\u2013221 (2003)","DOI":"10.1016\/S0166-218X(02)00446-8"},{"key":"9187_CR38","doi-asserted-by":"crossref","unstructured":"R. Overbeck, Structural attacks for public key cryptosystems based on Gabidulin codes. J. Cryptol. 21(2), 280\u2013301 (2008)","DOI":"10.1007\/s00145-007-9003-9"},{"key":"9187_CR39","unstructured":"E. Persichetti, On a CCA2-secure variant of McEliece in the standard model. Cryptology ePrint Archive, Report 2012\/268 (2012)"},{"key":"9187_CR40","doi-asserted-by":"crossref","unstructured":"C. Peters, Information-set decoding for linear codes over $$\\mathbb{F}_q$$ F q , in N. Sendrier (ed.) Post-Quantum Cryptography. LNCS, vol. 6061 (Springer, Berlin\/Heidelberg, 2010), pp. 81\u201394","DOI":"10.1007\/978-3-642-12929-2_7"},{"key":"9187_CR41","unstructured":"C. Peters, (2010), http:\/\/christianepeters.wordpress.com\/publications\/tools\/"},{"key":"9187_CR42","doi-asserted-by":"crossref","unstructured":"K. Preetha Mathew, S. Vasant, S., Venkatesan, C. Pandu Rangan, An efficient IND-CCA2 secure variant of the Niederreiter encryption scheme in the standard model, in Information Security and Privacy. LNCS, vol. 7372 (Springer-Verlag, 2012), pp. 166\u2013179","DOI":"10.1007\/978-3-642-31448-3_13"},{"key":"9187_CR43","doi-asserted-by":"crossref","unstructured":"H. Rashwan, E.M. Gabidulin, B. Honary, Security of the GPT cryptosystem and its applications to cryptography. Secur. Commun. Netw. 4(8), 937\u2013946 (2011)","DOI":"10.1002\/sec.228"},{"key":"9187_CR44","unstructured":"R. Rastaghi, An efficient CCA2-secure variant of the McEliece cryptosystem in the standard model. Cryptology ePrint Archive, Report 2013\/040 (2013)"},{"key":"9187_CR45","doi-asserted-by":"crossref","unstructured":"D. Schipani, M. Elia, J. Rosenthal, On the decoding complexity of cyclic codes up to the BCH bound, in Proceedings of the IEEE International Symposium on Information Theory (ISIT 2011) (Saint Petersburg, Russia, 2011), pp. 835\u2013839","DOI":"10.1109\/ISIT.2011.6034253"},{"key":"9187_CR46","doi-asserted-by":"crossref","unstructured":"V.M Sidelnikov, S.O. Shestakov, On insecurity of cryptosystems based on generalized Reed-Solomon codes, Discret. Math. Appl. 2(4), 439\u2013444 (1992)","DOI":"10.1515\/dma.1992.2.4.439"},{"key":"9187_CR47","unstructured":"V.G. Umana, G. Leander, Practical key recovery attacks on two McEliece variants, in C. Cid, J.C. Faug\u00e8re, (eds.) Proceeedings of the 2nd International Conference on Symbolic Computation and Cryptography, (Egham, UK, 2010), pp. 27\u201344"},{"key":"9187_CR48","doi-asserted-by":"crossref","unstructured":"C. Wieschebrink, Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes. In: N. Sendrier (ed.) Post-Quantum Cryptography (PQCrypto 2010). LNCS, vol. 6061 (Springer, 2010), pp. 61\u201372","DOI":"10.1007\/978-3-642-12929-2_5"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-014-9187-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-014-9187-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-014-9187-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-014-9187-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T05:48:53Z","timestamp":1746337733000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-014-9187-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,15]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["9187"],"URL":"https:\/\/doi.org\/10.1007\/s00145-014-9187-8","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,15]]},"assertion":[{"value":"26 November 2012","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 August 2014","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}