{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:52:17Z","timestamp":1771613537148,"version":"3.50.1"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319293592","type":"print"},{"value":"9783319293608","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-29360-8_9","type":"book-chapter","created":{"date-parts":[[2016,2,3]],"date-time":"2016-02-03T10:46:23Z","timestamp":1454496383000},"page":"118-143","source":"Crossref","is-referenced-by-count":45,"title":["Cryptanalysis of the McEliece Public Key Cryptosystem Based on Polar Codes"],"prefix":"10.1007","author":[{"given":"Magali","family":"Bardet","sequence":"first","affiliation":[]},{"given":"Julia","family":"Chaulet","sequence":"additional","affiliation":[]},{"given":"Vlad","family":"Dragoi","sequence":"additional","affiliation":[]},{"given":"Ayoub","family":"Otmani","sequence":"additional","affiliation":[]},{"given":"Jean-Pierre","family":"Tillich","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,4]]},"reference":[{"issue":"7","key":"9_CR1","doi-asserted-by":"publisher","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","volume":"55","author":"E Arikan","year":"2009","unstructured":"Arikan, E.: Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. IEEE Trans. Inform. Theory 55(7), 3051\u20133073 (2009)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9_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 Bodrato","year":"2008","unstructured":"Bodrato, M., Chiaraluce, F., Baldi, M.: 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. 5229, pp. 246\u2013262. Springer, Heidelberg (2008)"},{"key":"9_CR3","volume-title":"Post-Quantum Cryptography","year":"2009","unstructured":"Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.): Post-Quantum Cryptography. Springer-Verlag, Heidelberg (2009)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Baldi, M., Chiaraluce, F.: Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC codes. In: Proceedings of IEEE International Symposium Information Theory - ISIT, Nice, France, pp. 2591\u20132595 (2007)","DOI":"10.1109\/ISIT.2007.4557609"},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10623-003-6151-2","volume":"35","author":"P Thierry","year":"2005","unstructured":"Thierry, P.: Berger and Pierre Loidreau.: how to mask the structure of codes for a cryptographic use. Des. Codes Cryptogr. 35(1), 63\u201379 (2005)","journal-title":"Des. Codes Cryptogr."},{"key":"9_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":"DJ 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. 6544, pp. 143\u2013158. Springer, Heidelberg (2011)"},{"key":"9_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":"T Lange","year":"2011","unstructured":"Lange, T., Peters, C., Bernstein, D.J.: Wild McEliece incognito. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 244\u2013254. Springer, Heidelberg (2011)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-45682-1_10","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"NT Courtois","year":"2001","unstructured":"Courtois, N.T., Finiasz, M., Sendrier, N.: How to achieve a McEliece-Based digital signature scheme. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 157\u2013174. Springer, Heidelberg (2001)"},{"issue":"2","key":"9_CR9","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s10623-014-9967-z","volume":"73","author":"A Couvreur","year":"2014","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. Des. Codes Cryptogr. 73(2), 641\u2013666 (2014)","journal-title":"Des. Codes Cryptogr."},{"key":"9_CR10","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. In: Proceedings of IEEE International Symposium Information Theory - ISIT 2014, pp. 1446\u20131450, June 2014","DOI":"10.1109\/ISIT.2014.6875072"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-55220-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"A Couvreur","year":"2014","unstructured":"Couvreur, A., Tillich, J.P., Otmani, A.: Polynomial time attack on wild McEliece over quadratic extensions. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 17\u201339. Springer, Heidelberg (2014)"},{"key":"9_CR12","series-title":"Wiley Series in Telecommunications","doi-asserted-by":"crossref","DOI":"10.1002\/0471200611","volume-title":"Information Theory","author":"TM Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Information Theory. Wiley Series in Telecommunications. Wiley, New York (1991)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Canto-Torres, R., Sendrier, N.: Analysis of information set decoding for a sub-linear error weight (2015) (preprint)","DOI":"10.1007\/978-3-319-29360-8_10"},{"key":"9_CR14","unstructured":"Dumer, I.: On minimum distance decoding of linear codes. In: Proceedings of the 5th Joint Soviet-Swedish International Workshop Information Theory, Moscow, pp. 50\u201352 (1991)"},{"key":"9_CR15","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":"9_CR16","series-title":"Lecture Notes in Computer Science","first-page":"21","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"L Perret","year":"2014","unstructured":"Perret, L., de Portzamparc, F., Faug\u00e8re, J.-C.: Algebraic attack against variants of McEliece with goppa polynomial of a special form. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8873, pp. 21\u201341. Springer, Heidelberg (2014)"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Hooshmand, R., Shooshtari, M.K., Eghlidos, T., Aref, M.R.: Reducing the key length of McEliece cryptosystem using polar codes. In: 2014 11th International ISC Conference on Information Security and Cryptology (ISCISC), pp. 104\u2013108. IEEE (2014)","DOI":"10.1109\/ISCISC.2014.6994031"},{"issue":"3","key":"9_CR18","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. 8(3), 293\u2013307 (1996)","journal-title":"Des. Codes Cryptogr."},{"key":"9_CR19","unstructured":"David Kravitz.: Digital signature algorithm. US patent 5231668, July 1991"},{"issue":"4","key":"9_CR20","doi-asserted-by":"publisher","first-page":"1751","DOI":"10.1109\/TIT.2010.2040961","volume":"56","author":"SB Korada","year":"2010","unstructured":"Korada, S.B., Urbanke, R.: Polar codes are optimal for lossy source coding. IEEE Trans. Inform. Theory 56(4), 1751\u20131768 (2010)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9_CR21","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":"T Johansson","year":"2012","unstructured":"Johansson, T., L\u00f6ndahl, C.: A new version of McEliece PKC based on convolutional codes. In: Chim, T.W., Yuen, T.H. (eds.) ICICS 2012. LNCS, vol. 7618, pp. 461\u2013470. Springer, Heidelberg (2012)"},{"key":"9_CR22","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. 7932, pp. 102\u2013117. Springer, Heidelberg (2013)"},{"key":"9_CR23","unstructured":"McEliece, R.J.: A public-key system based on algebraic coding theory, pp. 114\u2013116. Jet Propulsion Lab, 1978. DSN Progress Report 44"},{"key":"9_CR24","unstructured":"Minder, L.: Cryptography based on error correcting codes. Ph.D thesis, Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne (2007)"},{"key":"9_CR25","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1986","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes, 5th edn. North- Holland Publishing, Amsterdam (1986)","edition":"5"},{"key":"9_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, M.A.: Cryptanalysis of the sidelnikov cryptosystem. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 347\u2013360. Springer, Heidelberg (2007)"},{"key":"9_CR27","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, Report 2012\/409, 2012 (2012)","DOI":"10.1109\/ISIT.2013.6620590"},{"issue":"2","key":"9_CR28","first-page":"159","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Probl. Control Inf. Theory 15(2), 159\u2013166 (1986)","journal-title":"Probl. Control Inf. Theory"},{"key":"9_CR29","unstructured":"Otmani, A., Tillich, J.-P.: On the design of code-based signatures. In: Code-based Cryptography Workshop (CBC 2012), Lyngby, Denmark, May 2012"},{"key":"9_CR30","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 28\u201330 2008, pp. 69\u201381. LMIB Beihang University (2008)"},{"issue":"5","key":"9_CR31","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1109\/18.623157","volume":"43","author":"E Petrank","year":"1997","unstructured":"Petrank, E., Roth, R.M.: Is code equivalence easy to decide? IEEE Trans. Inform. Theory 43(5), 1602\u20131604 (1997)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"9_CR32","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"issue":"4","key":"9_CR33","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 46(4), 1193\u20131203 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"9_CR34","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9_CR35","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1515\/dma.1994.4.3.191","volume":"4","author":"VM Sidelnikov","year":"1994","unstructured":"Sidelnikov, V.M.: A public-key cryptosytem based on Reed-Muller codes. Discrete Math. Appl. 4(3), 191\u2013207 (1994)","journal-title":"Discrete Math. Appl."},{"key":"9_CR36","doi-asserted-by":"crossref","unstructured":"Shrestha, S.R., Kim, Y.-S.: New McEliece cryptosystem based on polar codes as a candidate for post-quantum cryptography. In: 2014 14th International Symposium on Communications and Information Technologies (ISCIT), pp. 368\u2013372. IEEE (2014)","DOI":"10.1109\/ISCIT.2014.7011934"},{"issue":"4","key":"9_CR37","first-page":"439","volume":"1","author":"VM Sidelnikov","year":"1992","unstructured":"Sidelnikov, V.M., Shestakov, S.O.: On the insecurity of cryptosystems based on generalized Reed-Solomon codes. Discrete Math. Appl. 1(4), 439\u2013444 (1992)","journal-title":"Discrete Math. Appl."},{"key":"9_CR38","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":"1998","unstructured":"Stern, J.: A method for finding codewords of small weight. In: Cohen, G.D., Wolfmann, J. (eds.) Coding Theory and Applications. LNCS, vol. 388, pp. 106\u2013113. Springer, Heidelberg (1998)"},{"key":"9_CR39","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. 6061, pp. 61\u201372. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29360-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T12:56:00Z","timestamp":1559393760000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-29360-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319293592","9783319293608"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29360-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}