{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T12:36:42Z","timestamp":1785242202021,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":48,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642552199","type":"print"},{"value":"9783642552205","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-55220-5_2","type":"book-chapter","created":{"date-parts":[[2014,4,30]],"date-time":"2014-04-30T07:47:50Z","timestamp":1398844070000},"page":"17-39","source":"Crossref","is-referenced-by-count":32,"title":["Polynomial Time Attack on Wild McEliece over Quadratic Extensions"],"prefix":"10.1007","author":[{"given":"Alain","family":"Couvreur","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ayoub","family":"Otmani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean\u2013Pierre","family":"Tillich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Baldi, M., Bianchi, M., Chiaraluce, F., Rosenthal, J., Schipani, D.: Enhanced public key security for the McEliece cryptosystem. arxiv:1108.2462v2[cs.IT] (2011) (submitted)"},{"key":"2_CR2","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, 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":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-642-29011-4_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A. Becker","year":"2012","unstructured":"Becker, A., Joux, A., May, A., Meurer, A.: Decoding random binary linear codes in 2\n                    n\/20: How 1 + 1 = 0 improves information set decoding. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 520\u2013536. Springer, Heidelberg (2012)"},{"issue":"1","key":"2_CR4","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. Des. Codes Cryptogr.\u00a035(1), 63\u201379 (2005)","journal-title":"Des. Codes Cryptogr."},{"key":"2_CR5","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":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-19574-7_10","volume-title":"Selected Areas in Cryptography","author":"D.J. Bernstein","year":"2011","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Wild mcEliece. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol.\u00a06544, pp. 143\u2013158. Springer, Heidelberg (2011)"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-25405-5_16","volume-title":"Post-Quantum Cryptography","author":"D.J. Bernstein","year":"2011","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Wild mcEliece incognito. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol.\u00a07071, pp. 244\u2013254. Springer, Heidelberg (2011)"},{"key":"2_CR8","unstructured":"Bogdanov, A., Lee, C.H.: Homorphic encryption from codes. In: Proceedings of the 44th ACM Symposium on Theory of Computing (STOC) (2012) (to appear)"},{"issue":"3\/4","key":"2_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W. Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J.J., Playoust, C.: The Magma algebra system I: The user language. J. Symbolic Comput.\u00a024(3\/4), 235\u2013265 (1997)","journal-title":"J. Symbolic Comput."},{"issue":"1","key":"2_CR10","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1109\/18.651067","volume":"44","author":"A. Canteaut","year":"1998","unstructured":"Canteaut, A., Chabaud, F.: A new algorithm for finding minimum-weight words in a linear code: Application to McEliece\u2019s cryptosystem and to narrow-sense BCH codes of length 511. IEEE Trans. Inform. Theory\u00a044(1), 367\u2013378 (1998)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-642-03356-8_28","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"I. Cascudo","year":"2009","unstructured":"Cascudo, I., Chen, H., Cramer, R., Xing, C.: Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 466\u2013486. Springer, Heidelberg (2009)"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/978-3-642-22792-9_39","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"I. Cascudo","year":"2011","unstructured":"Cascudo, I., Cramer, R., Xing, C.: The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 685\u2013705. Springer, Heidelberg (2011)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Couvreur, A., Gaborit, P., Gauthier-Uma\u00f1a, V., Otmani, A., Tillich, J.-P.: Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes. ArXiv:1307.6458 (2014) To appear in Des. Codes Cryptogr.","DOI":"10.1007\/s10623-014-9967-z"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Couvreur, A., M\u00e1rquez-Corbella, I., Pellikaan, R.: A polynomial time attack against algebraic geometry code based public key cryptosystems. ArXiv:1401.6025 (January 2014)","DOI":"10.1109\/ISIT.2014.6875072"},{"key":"2_CR15","unstructured":"Couvreur, A., Otmani, A., Tillich, J.-P.: New identities relating Wild Goppa codes. ArXiv:1310.3202v2 (2013)"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.-C., Gauthier-Uma\u00f1a, V., Otmani, A., Perret, L., Tillich, J.-P.: A distinguisher for high rate McEliece cryptosystems. In: Proceedings of the Information Theory Workshop 2011, ITW 2011, Paraty, Brasil, pp. 282\u2013286 (2011)","DOI":"10.1109\/ITW.2011.6089437"},{"issue":"10","key":"2_CR17","doi-asserted-by":"publisher","first-page":"6830","DOI":"10.1109\/TIT.2013.2272036","volume":"59","author":"J.-C. Faug\u00e8re","year":"2013","unstructured":"Faug\u00e8re, J.-C., Gauthier-Uma\u00f1a, V., Otmani, A., Perret, L., Tillich, J.-P.: A distinguisher for high rate McEliece cryptosystems. IEEE Trans. Inform. Theory\u00a059(10), 6830\u20136844 (2013)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-13190-5_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"J.-C. Faug\u00e8re","year":"2010","unstructured":"Faug\u00e8re, J.-C., Otmani, A., Perret, L., Tillich, J.-P.: Algebraic cryptanalysis of mcEliece variants with compact keys. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 279\u2013298. Springer, Heidelberg (2010)"},{"key":"2_CR19","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, pp. 99\u2013107 (June 2008)"},{"key":"2_CR20","unstructured":"Gauthier-Uma\u00f1a, V., Leander, G.: Practical key recovery attacks on two McEliece variants. IACR Cryptology ePrint Archive 509 (2009)"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/3-540-46416-6_46","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"J.K. Gibson","year":"1991","unstructured":"Gibson, J.K.: Equivalent Goppa codes and trapdoors to McEliece\u2019s public key cryptosystem. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 517\u2013521. Springer, Heidelberg (1991)"},{"issue":"3","key":"2_CR22","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. Des. Codes Cryptogr.\u00a08(3), 293\u2013307 (1996)","journal-title":"Des. Codes Cryptogr."},{"key":"2_CR23","unstructured":"K\u00f6tter, R.: A unified description of an error locating procedure for linear codes. In: Proc. Algebraic and Combinatorial Coding Theory, Voneshta Voda, pp. 113\u2013117 (1992)"},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-38616-9_7","volume-title":"Post-Quantum Cryptography","author":"G. Landais","year":"2013","unstructured":"Landais, G., Tillich, J.-P.: An efficient attack of a mcEliece cryptosystem variant based on convolutional codes. In: Gaborit, P. (ed.) PQCrypto 2013. LNCS, vol.\u00a07932, pp. 102\u2013117. Springer, Heidelberg (2013)"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-45961-8_25","volume-title":"Advances in Cryptology - EUROCRYPT \u201988","author":"P.J. Lee","year":"1988","unstructured":"Lee, P.J., Brickell, E.F.: An observation on the security of McEliece\u2019s public-key cryptosystem. In: G\u00fcnther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol.\u00a0330, pp. 275\u2013280. Springer, Heidelberg (1988)"},{"issue":"5","key":"2_CR26","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1109\/18.21270","volume":"34","author":"J.S. Leon","year":"1988","unstructured":"Leon, J.S.: A probabilistic algorithm for computing minimum weights of large error-correcting codes. IEEE Trans. Inform. Theory\u00a034(5), 1354\u20131359 (1988)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"2_CR27","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1109\/18.915687","volume":"47","author":"P. Loidreau","year":"2001","unstructured":"Loidreau, P., Sendrier, N.: Weak keys in the McEliece public-key cryptosystem. IEEE Trans. Inform. Theory\u00a047(3), 1207\u20131211 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-3-642-34129-8_45","volume-title":"Information and Communications Security","author":"C. L\u00f6ndahl","year":"2012","unstructured":"L\u00f6ndahl, C., Johansson, T.: A new version of mcEliece PKC based on convolutional codes. In: Chim, T.W., Yuen, T.H. (eds.) ICICS 2012. LNCS, vol.\u00a07618, pp. 461\u2013470. Springer, Heidelberg (2012)"},{"key":"2_CR29","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, 1st edn. North\u2013Holland, Amsterdam (1986)","edition":"1"},{"key":"2_CR30","unstructured":"M\u00e1rquez-Corbella, I., Mart\u00ednez-Moro, E., Pellikaan, R.: Evaluation of public-key cryptosystems based on algebraic geometry codes. In: Borges, J., Villanueva, M. (eds.) Proceedings of the Third International Castle Meeting on Coding Theory and Applications, Barcelona, Spain, September\u00a011-15, pp. 199\u2013204 (2011)"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"M\u00e1rquez-Corbella, I., Mart\u00ednez-Moro, E., Pellikaan, R.: The non-gap sequence of a subcode of a Generalized Reed\u2013Solomon code. In: Des. Codes Cryptogr, pp. 1\u201317 (2012)","DOI":"10.1007\/s10623-012-9694-2"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"M\u00e1rquez-Corbella, I., Mart\u00ednez-Moro, E., Pellikaan, R.: On the unique representation of very strong algebraic geometry codes. Des. Codes Cryptogr., 1\u201316 (2012) (in press)","DOI":"10.1007\/s10623-012-9758-3"},{"key":"2_CR33","unstructured":"M\u00e1rquez-Corbella, I., Pellikaan, R.: Error-correcting pairs for a public-key cryptosystem (2012) (preprint)"},{"key":"2_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-25385-0_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"A. May","year":"2011","unstructured":"May, A., Meurer, A., Thomae, E.: Decoding random linear codes in \n                    \n                      \n                    \n                    $\\tilde{\\mathcal{O}}(2^{0.054n})$\n                  . In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 107\u2013124. Springer, Heidelberg (2011)"},{"key":"2_CR35","unstructured":"McEliece, R.J.: A Public-Key System Based on Algebraic Coding Theory. Jet Propulsion Lab., 114\u2013116 (1978), DSN Progress Report 44"},{"key":"2_CR36","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, M.A.: Cryptanalysis of the Sidelnikov Cryptosystem. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 347\u2013360. Springer, Heidelberg (2007)"},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"Misoczki, R., Tillich, J.-P., Sendrier, N., Barreto, P.S.L.M.: MDPC-McEliece: New McEliece variants from moderate density parity-check codes. IACR Cryptology ePrint Archive, 2012:409 (2012)","DOI":"10.1109\/ISIT.2013.6620590"},{"issue":"2","key":"2_CR38","first-page":"159","volume":"15","author":"H. Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Problems of Control and Information Theory\u00a015(2), 159\u2013166 (1986)","journal-title":"Problems of Control and Information Theory"},{"issue":"2","key":"2_CR39","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s11786-009-0015-8","volume":"3","author":"A. Otmani","year":"2010","unstructured":"Otmani, A., Tillich, J.-P., Dallot, L.: Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes. Special Issues of Mathematics in Computer Science\u00a03(2), 129\u2013140 (2010)","journal-title":"Special Issues of Mathematics in Computer Science"},{"key":"2_CR40","first-page":"368","volume":"107","author":"R. Pellikaan","year":"1992","unstructured":"Pellikaan, R.: On decoding by error location and dependent sets of error positions. Discrete Math.\u00a0107, 368\u2013381 (1992)","journal-title":"Discrete Math."},{"key":"2_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-12929-2_7","volume-title":"Post-Quantum Cryptography","author":"C. Peters","year":"2010","unstructured":"Peters, C.: Information-set decoding for linear codes over f\n                  \n                    q\n                  . In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol.\u00a06061, pp. 81\u201394. Springer, Heidelberg (2010)"},{"issue":"4","key":"2_CR42","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/18.850662","volume":"46","author":"N. Sendrier","year":"2000","unstructured":"Sendrier, N.: Finding the permutation between equivalent linear codes: The support splitting algorithm. IEEE Trans. Inform. Theory\u00a046(4), 1193\u20131203 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"2_CR43","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 Math. Appl.\u00a04(3), 191\u2013207 (1994)","journal-title":"Discrete Math. Appl."},{"issue":"4","key":"2_CR44","first-page":"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 Math. Appl.\u00a01(4), 439\u2013444 (1992)","journal-title":"Discrete Math. Appl."},{"key":"2_CR45","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":"1989","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 (1989)"},{"key":"2_CR46","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1109\/TIT.1976.1055610","volume":"22","author":"Y. Sugiyama","year":"1976","unstructured":"Sugiyama, Y., Kasahara, M., Hirasawa, S., Namekawa, T.: Further results on Goppa codes and their applications to constructing efficient binary codes. IEEE Trans. Inform. Theory\u00a022, 518\u2013526 (1976)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2_CR47","doi-asserted-by":"crossref","unstructured":"Wieschebrink, C.: Two NP-complete problems in coding theory with an application in code based cryptography. In: 2006 IEEE International Symposium on Information Theory, pp. 1733\u20131737 (2006)","DOI":"10.1109\/ISIT.2006.261651"},{"key":"2_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-12929-2_5","volume-title":"Post-Quantum Cryptography","author":"C. Wieschebrink","year":"2010","unstructured":"Wieschebrink, C.: Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol.\u00a06061, pp. 61\u201372. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-55220-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T14:25:46Z","timestamp":1558880746000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-55220-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642552199","9783642552205"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-55220-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}