{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:38:46Z","timestamp":1775054326486,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642131899","type":"print"},{"value":"9783642131905","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13190-5_14","type":"book-chapter","created":{"date-parts":[[2010,5,19]],"date-time":"2010-05-19T09:16:46Z","timestamp":1274260606000},"page":"279-298","source":"Crossref","is-referenced-by-count":92,"title":["Algebraic Cryptanalysis of McEliece Variants with Compact Keys"],"prefix":"10.1007","author":[{"given":"Jean-Charles","family":"Faug\u00e8re","sequence":"first","affiliation":[]},{"given":"Ayoub","family":"Otmani","sequence":"additional","affiliation":[]},{"given":"Ludovic","family":"Perret","sequence":"additional","affiliation":[]},{"given":"Jean-Pierre","family":"Tillich","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","volume-title":"An Introduction to Gr\u00f6bner Bases","author":"W. Adams","year":"1994","unstructured":"Adams, W., Loustaunau, P.: An Introduction to Gr\u00f6bner Bases. American Mathematical Society, Providence (July 1994)"},{"key":"14_CR2","unstructured":"Avanzi, R.: Lightweight asymmetric cryptography and alternatives to rsa, ecrypt european network of excellence in cryptology (2005), \n                    \n                      http:\/\/www.ecrypt.eu.org\/ecrypt1\/documents\/D.AZTEC.2-1.2.pdf"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-85855-3_17","volume-title":"Security and Cryptography for Networks","author":"M. Baldi","year":"2008","unstructured":"Baldi, M., Bodrato, M., Chiaraluce, G.F.: A new analysis of the McEliece cryptosystem based on QC-LDPC codes. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) SCN 2008. LNCS, vol.\u00a05229, pp. 246\u2013262. Springer, Heidelberg (2008)"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Baldi, M., Chiaraluce, G.F.: Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC codes. In: IEEE International Symposium on Information Theory, Nice, France, March 2007, pp. 2591\u20132595 (2007)","DOI":"10.1109\/ISIT.2007.4557609"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-02384-2_6","volume-title":"AFRICACRYPT 2009","author":"T.P. Berger","year":"2009","unstructured":"Berger, T.P., Cayrel, P.L., Gaborit, P., Otmani, A.: Reducing key length of the McEliece cryptosystem. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol.\u00a05580, pp. 77\u201397. Springer, Heidelberg (2009)"},{"issue":"1","key":"14_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10623-003-6151-2","volume":"35","author":"T.P. Berger","year":"2005","unstructured":"Berger, T.P., Loidreau, P.: How to mask the structure of codes for a cryptographic use. Designs Codes and Cryptography\u00a035(1), 63\u201379 (2005)","journal-title":"Designs Codes and Cryptography"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-540-30556-9_18","volume-title":"Progress in Cryptology - INDOCRYPT 2004","author":"T.P. Berger","year":"2004","unstructured":"Berger, T.P., Loidreau, P.: Designing an efficient and secure public-key cryptosystem based on reducible rank codes. In: Canteaut, A., Viswanathan, K. (eds.) INDOCRYPT 2004. LNCS, vol.\u00a03348, pp. 218\u2013229. Springer, Heidelberg (2004)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-88403-3_3","volume-title":"Post-Quantum Cryptography","author":"D.J. Bernstein","year":"2008","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Attacking and defending the McEliece cryptosystem. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol.\u00a05299, pp. 31\u201346. Springer, Heidelberg (2008)"},{"key":"14_CR9","unstructured":"Bernstein, D.J., Lange, T., Peters, C., van Tilborg, H.: Explicit bounds for generic decoding algorithms for code-based cryptography. In: Pre-proceedings of WCC 2009, pp. 168\u2013180 (2009)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-540-88403-3_4","volume-title":"Post-Quantum Cryptography","author":"B. Biswas","year":"2008","unstructured":"Biswas, B., Sendrier, N.: McEliece cryptosystem implementation: Theory and practice. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol.\u00a05299, pp. 47\u201362. Springer, Heidelberg (2008)"},{"key":"14_CR11","unstructured":"Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. PhD thesis, Innsbruck (1965)"},{"key":"14_CR12","series-title":"Undergraduate Texts in Mathematics","volume-title":"Ideals, Varieties, and algorithms: an Introduction to Computational Algebraic Geometry and Commutative Algebra","author":"D.A. Cox","year":"2001","unstructured":"Cox, D.A., Little, J.B., O\u2019Shea, D.: Ideals, Varieties, and algorithms: an Introduction to Computational Algebraic Geometry and Commutative Algebra. Undergraduate Texts in Mathematics. Springer, New York (2001)"},{"issue":"1-3","key":"14_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"J.-C. Faug\u00e8re","year":"1999","unstructured":"Faug\u00e8re, J.-C.: A new efficient algorithm for computing gr\u00f6bner bases (f4). Journal of Pure and Applied Algebra\u00a0139(1-3), 61\u201388 (1999)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/780506.780516","volume-title":"ISSAC 2002","author":"J.-C. Faug\u00e8re","year":"2002","unstructured":"Faug\u00e8re, J.-C.: A new efficient algorithm for computing gr\u00f6bner bases without reduction to zero: F5. In: ISSAC 2002, pp. 75\u201383. ACM press, New York (2002)"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/978-3-540-85174-5_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"J.-C. Faug\u00e8re","year":"2008","unstructured":"Faug\u00e8re, J.-C., Levy-dit Vehel, F., Perret, L.: Cryptanalysis of minrank. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 280\u2013296. Springer, Heidelberg (2008)"},{"key":"14_CR16","unstructured":"Faug\u00e8re, J.-C., El Din, M.S., Spaenlehauer, P.-J.: Gr\u00f6bner bases of bihomogeneous ideals generated by polynomials of bidegree (1,1): Algorithms and complexity. CoRR, abs\/1001.4004 (2010)"},{"issue":"4","key":"14_CR17","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1006\/jsco.1993.1051","volume":"16","author":"J.-C. Faug\u00e8re","year":"1993","unstructured":"Faug\u00e8re, J.-C., Gianni, P.M., Lazard, D., Mora, T.: Efficient computation of zero-dimensional gr\u00f6bner bases by change of ordering. J. Symb. Comput.\u00a016(4), 329\u2013344 (1993)","journal-title":"J. Symb. Comput."},{"key":"14_CR18","unstructured":"Faure, C., Minder, L.: Cryptanalysis of the McEliece cryptosystem over hyperelliptic curves. In: Proceedings of the eleventh International Workshop on Algebraic and Combinatorial Coding Theory, Pamporovo, Bulgaria, June 2008, pp. 99\u2013107 (2008)"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-10366-7_6","volume-title":"Asiacrypt 2009","author":"M. Finiasz","year":"2009","unstructured":"Finiasz, M., Sendrier, N.: Security bounds for the design of code-based crypto systems. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 88\u2013105. Springer, Heidelberg (2009)"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1007\/3-540-46416-6_41","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"E. Gabidulin","year":"1991","unstructured":"Gabidulin, E., Paramonov, A.V., Tretjakov, O.V.: Ideals over a non-commutative ring and their applications to cryptography. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 482\u2013489. Springer, Heidelberg (1991)"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","first-page":"81","volume-title":"Coding and Cryptography","author":"P. Gaborit","year":"2006","unstructured":"Gaborit, P.: Shorter keys for code based cryptography. In: Ytrehus, \u00d8. (ed.) WCC 2005. LNCS, vol.\u00a03969, pp. 81\u201391. Springer, Heidelberg (2006)"},{"issue":"1","key":"14_CR22","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF01390769","volume":"6","author":"J.K. Gibson","year":"1995","unstructured":"Gibson, J.K.: Severely denting the Gabidulin version of the McEliece public key cryptosystem. Design Codes and Cryptography\u00a06(1), 37\u201345 (1995)","journal-title":"Design Codes and Cryptography"},{"issue":"3","key":"14_CR23","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/A:1027351723034","volume":"8","author":"H. Janwa","year":"1996","unstructured":"Janwa, H., Moreno, O.: McEliece public key cryptosystems using algebraic-geometric codes. Designs Codes and Cryptography\u00a08(3), 293\u2013307 (1996)","journal-title":"Designs Codes and Cryptography"},{"key":"14_CR24","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1986","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes, 5th edn. North-Holland, Amsterdam (1986)","edition":"5"},{"key":"#cr-split#-14_CR25.1","unstructured":"McEliece, R.J.: A Public-Key System Based on Algebraic Coding Theory, pp. 114???116. Jet Propulsion Lab. (1978);"},{"key":"#cr-split#-14_CR25.2","unstructured":"DSN Progress Report 44"},{"key":"14_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-540-72540-4_20","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"L. Minder","year":"2007","unstructured":"Minder, L., Shokrollahi, A.: Cryptanalysis of the Sidelnikov cryptosystem. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 347\u2013360. Springer, Heidelberg (2007)"},{"key":"14_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/978-3-642-05445-7_24","volume-title":"SAC 2009","author":"R. Misoczki","year":"2009","unstructured":"Misoczki, R., Barreto, P.S.L.M.: Compact McEliece keys from Goppa codes. In: Jacobson Jr., M.J., Rijmen, V., Safavi-Naini, R. (eds.) SAC 2009. LNCS, vol.\u00a05867, pp. 376\u2013392. Springer, Heidelberg (2009)"},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/3-540-39805-8_4","volume-title":"Advances in Cryptology - EUROCRYPT \u201985","author":"H. Niederreiter","year":"1985","unstructured":"Niederreiter, H.: A public-key cryptosystem based on shift register sequences. In: Pichler, F. (ed.) EUROCRYPT 1985. LNCS, vol.\u00a0219, pp. 35\u201339. Springer, Heidelberg (1985)"},{"key":"14_CR29","unstructured":"Otmani, A., Tillich, J.P., Dallot, L.: Cryptanalysis of McEliece cryptosystem based on quasi-cyclic ldpc codes. In: Proceedings of First International Conference on Symbolic Computation and Cryptography, Beijing, China, April\u00a028-30, pp. 69\u201381. LMIB Beihang University (2008)"},{"issue":"2","key":"14_CR30","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s00145-007-9003-9","volume":"21","author":"R. Overbeck","year":"2008","unstructured":"Overbeck, R.: Structural attacks for public key cryptosystems based on Gabidulin codes. J. Cryptology\u00a021(2), 280\u2013301 (2008)","journal-title":"J. Cryptology"},{"issue":"3","key":"14_CR31","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1515\/dma.1994.4.3.191","volume":"4","author":"V.M. Sidelnikov","year":"1994","unstructured":"Sidelnikov, V.M.: A public-key cryptosytem based on Reed-Muller codes. Discrete Mathematics and Applications\u00a04(3), 191\u2013207 (1994)","journal-title":"Discrete Mathematics and Applications"},{"issue":"4","key":"14_CR32","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1515\/dma.1992.2.4.439","volume":"1","author":"V.M. Sidelnikov","year":"1992","unstructured":"Sidelnikov, V.M., Shestakov, S.O.: On the insecurity of cryptosystems based on generalized Reed-Solomon codes. Discrete Mathematics and Applications\u00a01(4), 439\u2013444 (1992)","journal-title":"Discrete Mathematics and Applications"},{"key":"14_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/BFb0019850","volume-title":"Coding Theory and Applications","author":"J. Stern","year":"1988","unstructured":"Stern, J.: A method for finding codewords of small weight. In: Wolfmann, J., Cohen, G. (eds.) Coding Theory 1988. LNCS, vol.\u00a0388, pp. 106\u2013113. Springer, Heidelberg (1988)"},{"key":"14_CR34","unstructured":"Gauthier Umana, V., Leander, G.: Practical key recovery attacks on two McEliece variants (2009), \n                    \n                      http:\/\/eprint.iacr.org\/2009\/509"},{"key":"14_CR35","unstructured":"Wieschebrink, C.: Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes. eprint 452 (2009), \n                    \n                      http:\/\/eprint.iacr.org\/2009\/452.pdf"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13190-5_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T07:57:12Z","timestamp":1619769432000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13190-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131899","9783642131905"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13190-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}