{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:33:18Z","timestamp":1725600798014},"publisher-location":"Berlin, Heidelberg","reference-count":78,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642231407"},{"type":"electronic","value":"9783642231414"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23141-4_3","type":"book-chapter","created":{"date-parts":[[2011,8,17]],"date-time":"2011-08-17T12:36:48Z","timestamp":1313584608000},"page":"21-32","source":"Crossref","is-referenced-by-count":4,"title":["Recent Progress in Code-Based Cryptography"],"prefix":"10.1007","author":[{"given":"Pierre-Louis","family":"Cayrel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sidi Mohamed","family":"El Yousfi Alaoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard","family":"Hoffmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed","family":"Meziani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Niebuhr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Berlekamp, E., McEliece, R., van Tilborg, H.: On the Inherent Intractability of Certain Coding Problems. IEEE Transactions on Information Theory\u00a0IT-24(3) (1978)","DOI":"10.1109\/TIT.1978.1055873"},{"key":"3_CR2","unstructured":"McEliece, R.: A Public-Key Cryptosystem Based on Algebraic Coding Theory. The Deep Space Network Progress Report, DSN PR, 42\u201344 (1978), http:\/\/ipnpr.jpl.nasa.gov\/progressreport2\/42-44\/44N.PDF"},{"issue":"2","key":"3_CR3","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"},{"key":"3_CR4","first-page":"95","volume-title":"Code-Based Cryptography","author":"R. Overbeck","year":"2008","unstructured":"Overbeck, R., Sendrier, N.: Code-Based Cryptography, pp. 95\u2013146. Springer, Heidelberg (2008)"},{"key":"3_CR5","unstructured":"Barreto, P.S.L.M., Lindner, R., Misoczki, R.: Decoding Square-Free Goppa Codes over $\\mathbb{F}_p$ . Cryptology ePrint Archive, Report 2010\/372 (2010), http:\/\/eprint.iacr.org\/"},{"key":"3_CR6","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":"Progress in Cryptology \u2013 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)"},{"key":"3_CR7","unstructured":"Bernstein, D.J.: List Decoding for Binary Goppa Codes. Preprint (2008), http:\/\/cr.yp.to\/papers.html#goppalist"},{"key":"3_CR8","volume-title":"Post-Quantum Cryptography","author":"D.J. Bernstein","year":"2008","unstructured":"Bernstein, D.J., Buchmann, J., Dahmen, E.: Post-Quantum Cryptography. Springer, Heidelberg (2008)"},{"key":"3_CR9","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":"3_CR10","unstructured":"Gaborit, P.: Shorter Keys for Code-based Cryptography. In: International Workshop on Coding and Cryptography \u2013 WCC 2005, pp. 81\u201391. ACM Press, Bergen (2005)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-12929-2_11","volume-title":"Post-Quantum Cryptography","author":"P. Loidreau","year":"2010","unstructured":"Loidreau, P.: Designing a rank metric based McEliece cryptosystem. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol.\u00a06061, pp. 142\u2013152. Springer, Heidelberg (2010)"},{"key":"3_CR12","unstructured":"McEliece, R.: A Public-Key Cryptosystem Based on Algebraic Coding Theory. The Deep Space Network Progress Report, DSN PR, 42\u201344 (1978), http:\/\/ipnpr.jpl.nasa.gov\/progressreport2\/42-44\/44N.PDF"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Misoczki, R., Barreto, P.S.L.M.: Compact McEliece Keys from Goppa Codes (2009) (preprint), http:\/\/eprint.iacr.org\/2009\/187.pdf","DOI":"10.1007\/978-3-642-05445-7_24"},{"issue":"2","key":"3_CR14","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"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-540-85893-5_14","volume-title":"Smart Card Research and Advanced Applications","author":"P.-L. Cayrel","year":"2008","unstructured":"Cayrel, P.-L., Gaborit, P., Prouff, E.: Secure Implementation of the Stern Authentication and Signature Schemes for Low-Resource Devices. In: Grimaud, G., Standaert, F.-X. (eds.) CARDIS 2008. LNCS, vol.\u00a05189, pp. 191\u2013205. Springer, Heidelberg (2008)"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-19574-7_12","volume-title":"Selected Areas in Cryptography","author":"P.-L. Cayrel","year":"2011","unstructured":"Cayrel, P.-L., V\u00e9ron, P., Alaoui, S.M.Y.: A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol.\u00a06544, pp. 171\u2013186. Springer, Heidelberg (2011)"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1109\/ISIT.2007.4557225","volume-title":"IEEE International Symposium on Information Theory \u2013 ISIT 2007","author":"P. Gaborit","year":"2007","unstructured":"Gaborit, P., Girault, M.: Lightweight Code-based Authentication and Signature. In: IEEE International Symposium on Information Theory \u2013 ISIT 2007, pp. 191\u2013195. IEEE, Nice (2007)"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1007\/0-387-34805-0_54","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"A. Shamir","year":"1990","unstructured":"Shamir, A.: An Efficient Identification Scheme Based on Permuted Kernels. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 606\u2013609. Springer, Heidelberg (1990)"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/3-540-48658-5_18","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"J. Stern","year":"1994","unstructured":"Stern, J.: Designing Identification Schemes with Keys of Short Size. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 164\u2013173. Springer, Heidelberg (1994)"},{"key":"3_CR20","first-page":"13","volume-title":"Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology","author":"J. Stern","year":"1994","unstructured":"Stern, J.: A New Identification Scheme Based on Syndrome Decoding. In: Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology, pp. 13\u201321. Springer-Verlag New York, Inc., New York (1994)"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Alabbadi, M., Wicker, S.B.: Security of Xinmei Digital Signature Scheme (1992)","DOI":"10.1049\/el:19920561"},{"key":"3_CR22","first-page":"9","volume-title":"IEEE International Symposium on Information Theory","author":"M. Alabbadi","year":"1993","unstructured":"Alabbadi, M., Wicker, S.B.: Digital Signature Scheme Based on Error-Correcting Codes. In: IEEE International Symposium on Information Theory, pp. 9\u201319. IEEE, Los Alamitos (1993)"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1007\/978-3-642-21518-6_23","volume-title":"Inscrypt 2010","author":"P.S.L.M. Barreto","year":"2011","unstructured":"Barreto, P.S.L.M., Cayrel, P.-L., Misoczki, R., Niebuhr, R.: Quasi-dyadic CFS signatures. In: Lin, D. (ed.) Inscrypt 2010. LNCS, vol.\u00a06584, pp. 336\u2013349. Springer, Heidelberg (2011)"},{"issue":"2","key":"3_CR24","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.jss.2010.09.016","volume":"84","author":"P.S.L.M. Barreto","year":"2011","unstructured":"Barreto, P.S.L.M., Misoczki, R., Simpl\u00edcio Jr., M.A.: One-Time Signature Scheme from Syndrome Decoding over Generic Error-Correcting Codes. Journal of Systems and Software\u00a084(2), 198\u2013204 (2011)","journal-title":"Journal of Systems and Software"},{"issue":"3","key":"3_CR25","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E. Berlekamp","year":"1978","unstructured":"Berlekamp, E., McEliece, R., van Tilborg, H.: On the Inherent Intractability of Certain Coding Problems. IEEE Transactions on Information Theory\u00a024(3), 384\u2013386 (1978)","journal-title":"IEEE Transactions on Information Theory"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-540-73074-3_18","volume-title":"Arithmetic of Finite Fields","author":"P.-L. Cayrel","year":"2007","unstructured":"Cayrel, P.-L., Otmani, A., Vergnaud, D.: On Kabatianskii-Krouk-Smeets Signatures. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol.\u00a04547, pp. 237\u2013251. Springer, Heidelberg (2007)"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Dallot, L.: Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme. In: Proceedings of WEWoRC 2007, Bochum, Germany (2007), http:\/\/users.info.unicaen.fr\/~ldallot\/download\/articles\/CFSProof-dallot.pdf","DOI":"10.1007\/978-3-540-88353-1_6"},{"key":"3_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-642-19574-7_11","volume-title":"Selected Areas in Cryptography","author":"M. Finiasz","year":"2011","unstructured":"Finiasz, M.: Parallel-CFS: Strengthening the CFS Mc-Eliece-Based Signature Scheme. In: Biryukov, A., Gong, G., Stinson, D. (eds.) SAC 2010. LNCS, vol.\u00a06544, pp. 159\u2013170. Springer, Heidelberg (2011)"},{"key":"3_CR29","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":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"M. Finiasz","year":"2009","unstructured":"Finiasz, M., Sendrier, N.: Security bounds for the design of code-based cryptosystems. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 88\u2013105. Springer, Heidelberg (2009), http:\/\/eprint.iacr.org\/2009\/414.pdf"},{"key":"3_CR30","unstructured":"Harn, L., Wang, D.C.: Cryptoanalysis and Modification of Digital Signature Scheme Based on Error-Correcting Codes (1992)"},{"key":"3_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BFb0024461","volume-title":"Cryptography and Coding","author":"G. Kabatianskii","year":"1997","unstructured":"Kabatianskii, G., Krouk, E., Smeets, B.J.M.: A Digital Signature Scheme Based on Random Error-Correcting Codes. In: Darnell, M.J. (ed.) Cryptography and Coding 1997. LNCS, vol.\u00a01355, pp. 161\u2013167. Springer, Heidelberg (1997)"},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/0-387-34805-0_22","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"C.P. Schnorr","year":"1990","unstructured":"Schnorr, C.P.: Efficient Identification and Signatures for Smart Cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 239\u2013252. Springer, Heidelberg (1990)"},{"key":"3_CR33","unstructured":"Augot, D., Finiasz, M., Gaborit, P., Manuel, S., Sendrier, N.: SHA-3 Proposal: FSB. Submission to the SHA-3 NIST Competition (2008)"},{"key":"3_CR34","unstructured":"Augot, D., Finiasz, M., Sendrier, N.: A Fast Provably Secure Cryptographic Hash Function. Cryptology ePrint Archive, Report 2003\/230 (2003), http:\/\/eprint.iacr.org\/"},{"key":"3_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/11554868_6","volume-title":"Progress in Cryptology \u2013 Mycrypt 2005","author":"D. Augot","year":"2005","unstructured":"Augot, D., Finiasz, M., Sendrier, N.: A Family of Fast Syndrome Based Cryptographic Hash Functions. In: Dawson, E., Vaudenay, S. (eds.) Mycrypt 2005. LNCS, vol.\u00a03715, pp. 64\u201383. Springer, Heidelberg (2005)"},{"key":"3_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-48658-5_22","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"M. Bellare","year":"1994","unstructured":"Bellare, M., Goldreich, O., Goldwasser, S.: Incremental Cryptography: The Case of Hashing and Signing. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 216\u2013233. Springer, Heidelberg (1994)"},{"key":"3_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/3-540-69053-0_13","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"M. Bellare","year":"1997","unstructured":"Bellare, M., Micciancio, D.: A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 163\u2013192. Springer, Heidelberg (1997)"},{"key":"3_CR38","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":"Progress in Cryptology \u2013 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)"},{"key":"3_CR39","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Lange, T., Peters, C., Schwabe, P.: Faster 2-regular Information-Set Decoding (2011)","DOI":"10.1007\/978-3-642-20901-7_5"},{"key":"3_CR40","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Lange, T., Peters, C., Schwabe, P.: Really Fast Syndrome-Based Hashing. Cryptology ePrint Archive, Report 2011\/074 (2011), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-21969-6_9"},{"key":"3_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/0-387-34805-0_39","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"I. Damg\u00e5rd","year":"1990","unstructured":"Damg\u00e5rd, I.: A Design Principle for Hash Functions. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 416\u2013427. Springer, Heidelberg (1990)"},{"key":"3_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/3-540-68339-9_22","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"J.-B. Fischer","year":"1996","unstructured":"Fischer, J.-B., Stern, J.: An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 245\u2013255. Springer, Heidelberg (1996)"},{"key":"3_CR43","doi-asserted-by":"crossref","unstructured":"Gaborit, P., Laudauroux, C., Sendrier, N.: SYND: A Fast Code-Based Stream Cipher with a Security Reduction. In: Proceeedings of ISIT 2007 (2007)","DOI":"10.1109\/ISIT.2007.4557224"},{"key":"3_CR44","unstructured":"Guillot, P.: Algorithmes pour le codage \u00e1 poids constant (unpublished)"},{"key":"3_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1007\/0-387-34805-0_40","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"R.C. Merkle","year":"1990","unstructured":"Merkle, R.C.: One Way Hash Functions and DES. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 428\u2013446. Springer, Heidelberg (1990)"},{"key":"3_CR46","unstructured":"Zobrist, A.L.: A New Hashing Method with Application for Game Playing. Technical Report 88, U. Wisconsin CS Department (April 1970), https:\/\/www.cs.wisc.edu\/techreports\/1970\/TR88.pdf"},{"key":"3_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/11554868_6","volume-title":"Progress in Cryptology \u2013 Mycrypt 2005","author":"D. Augot","year":"2005","unstructured":"Augot, D., Finiasz, M., Sendrier, N.: A Family of Fast Syndrome Based Cryptographic Hash Functions. In: Dawson, E., Vaudenay, S. (eds.) Mycrypt 2005. LNCS, vol.\u00a03715, pp. 64\u201383. Springer, Heidelberg (2005)"},{"key":"3_CR48","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":"Progress in Cryptology \u2013 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)"},{"key":"3_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-12929-2_6","volume-title":"Post-Quantum Cryptography","author":"D.J. Bernstein","year":"2010","unstructured":"Bernstein, D.J.: Grover vs. McEliece. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol.\u00a06061, pp. 73\u201380. Springer, Heidelberg (2010)"},{"key":"3_CR50","volume-title":"Post-Quantum Cryptography","author":"D.J. Bernstein","year":"2008","unstructured":"Bernstein, D.J., Buchmann, J., Dahmen, E.: Post-Quantum Cryptography. Springer, Heidelberg (2008)"},{"key":"3_CR51","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":"3_CR52","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Ball-Collision Decoding. Cryptology ePrint Archive, Report 2010\/585 (2010), http:\/\/eprint.iacr.org\/"},{"key":"3_CR53","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Lange, T., Peters, C., Schwabe, P.: Faster 2-regular Information-Set Decoding. Cryptology ePrint Archive, Report 2011\/120 (2011), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-20901-7_5"},{"issue":"1","key":"3_CR54","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 Primitive Narrow-Sense BCH-Codes of Length 511. IEEE Transactions on Information Theory\u00a044(1), 367\u2013378 (1998)","journal-title":"IEEE Transactions on Information Theory"},{"key":"3_CR55","unstructured":"Peters, C., Bernstein, D.J., Lange, T., van Tilborg, H.C.A.: Explicit Bounds for Generic Decoding Algorithms for Code-Based Cryptography. In: Pre-proceedings of WCC 2009, pp. 168\u2013180 (2009)"},{"key":"3_CR56","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.-C., Gauthier, V., Otmani, A., Perret, L., Tillich, J.-P.: A distinguisher for high rate mceliece cryptosystems. Cryptology ePrint Archive, Report 2010\/331 (2010), http:\/\/eprint.iacr.org\/","DOI":"10.1109\/ITW.2011.6089437"},{"key":"3_CR57","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":"3_CR58","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.-C., Otmani, A., Perret, L., Tillich, J.-P.: Algebraic Cryptanalysis of McEliece Variants with Compact Keys \u2013 Towards a Complexity Analysis. In: SCC 2010: Proceedings of the 2nd International Conference on Symbolic Computation and Cryptography, RHUL, pp. 45\u201355 (June 2010)","DOI":"10.1007\/978-3-642-13190-5_14"},{"key":"3_CR59","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":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"M. Finiasz","year":"2009","unstructured":"Finiasz, M., Sendrier, N.: Security Bounds for the Design of Code-based Cryptosystems. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 88\u2013105. Springer, Heidelberg (2009), http:\/\/eprint.iacr.org\/2009\/414.pdf"},{"key":"3_CR60","unstructured":"Gauthier, V., Leander, G.: Practical Key Recovery Attacks on Two McEliece Variants. Cryptology ePrint Archive, Report 2009\/509 (2009), http:\/\/eprint.iacr.org\/"},{"key":"3_CR61","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A Fast Quantum Mechanical Algorithm for Database Search. In: STOC, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"3_CR62","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":"3_CR63","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 Transactions on Information Theory\u00a034(5), 1354\u20131359 (1988)","journal-title":"IEEE Transactions on Information Theory"},{"key":"3_CR64","doi-asserted-by":"crossref","unstructured":"Minder, L., Sinclair, A.: The Extended k-tree Algorithm. In: SODA, pp. 586\u2013595 (2009)","DOI":"10.1137\/1.9781611973068.65"},{"key":"3_CR65","doi-asserted-by":"crossref","unstructured":"Misoczki, R., Barreto, P.S.L.M.: Compact McEliece Keys from Goppa Codes (2009) (preprint), http:\/\/eprint.iacr.org\/2009\/187.pdf","DOI":"10.1007\/978-3-642-05445-7_24"},{"key":"3_CR66","unstructured":"Niebuhr, R., Cayrel, P.-L., Buchmann, J.: Improving the Efficiency of Generalized Birthday Attacks Against Certain Structured Cryptosystems. In: WCC 2011 (April 2011)"},{"key":"3_CR67","unstructured":"Niebuhr, R., Cayrel, P.-L., Bulygin, S., Buchmann, J.: On Lower Bounds for Information Set Decoding over $\\mathbb{F}_q$ . In: SCC 2010, RHUL, London, UK (2010)"},{"key":"3_CR68","unstructured":"Otmani, A., Tillich, J.-P., Dallot, L.: Cryptanalysis of Two McEliece Cryptosystems Based on Quasi-Cyclic Codes (2008) (preprint), http:\/\/arxiv.org\/abs\/0804.0409v2"},{"issue":"2","key":"3_CR69","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"},{"key":"3_CR70","first-page":"95","volume-title":"Code-Based Cryptography","author":"R. Overbeck","year":"2008","unstructured":"Overbeck, R., Sendrier, N.: Code-Based Cryptography, pp. 95\u2013146. Springer, Heidelberg (2008)"},{"key":"3_CR71","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 $\\mathbb{F}_q$ . In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol.\u00a06061, pp. 81\u201394. Springer, Heidelberg (2010)"},{"key":"3_CR72","doi-asserted-by":"crossref","unstructured":"Prange, E.: The Use of Information Sets in Decoding Cyclic Codes. IRE Transactions on Information Theory, 5\u20139 (1962)","DOI":"10.1109\/TIT.1962.1057777"},{"key":"3_CR73","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P.W. Shor","year":"1995","unstructured":"Shor, P.W.: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM Journal on Computing\u00a026, 1484\u20131509 (1995)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"3_CR74","first-page":"57","volume":"4","author":"V. Sidelnikov","year":"1992","unstructured":"Sidelnikov, V., Shestakov, S.: On Cryptosystems based on Generalized Reed-Solomon Codes. Discrete Mathematics\u00a04(3), 57\u201363 (1992)","journal-title":"Discrete Mathematics"},{"key":"3_CR75","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":"3_CR76","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-45708-9_19","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"D. Wagner","year":"2002","unstructured":"Wagner, D.: A Generalized Birthday Problem. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 288\u2013304. Springer, Heidelberg (2002)"},{"key":"3_CR77","doi-asserted-by":"publisher","first-page":"1733","DOI":"10.1109\/ISIT.2006.261651","volume-title":"IEEE International Symposium on Information Theory \u2013 ISIT 2006","author":"C. Wieschebrink","year":"2006","unstructured":"Wieschebrink, C.: Two NP-complete Problems in Coding Theory with an Application in Code Based Cryptography. In: IEEE International Symposium on Information Theory \u2013 ISIT 2006, pp. 1733\u20131737. IEEE, Seattle (2006)"},{"key":"3_CR78","volume-title":"Post-Quantum Cryptography","author":"D.J. Bernstein","year":"2008","unstructured":"Bernstein, D.J., Buchmann, J., Dahmen, E.: Post-Quantum Cryptography. Springer, Heidelberg (2008)"}],"container-title":["Communications in Computer and Information Science","Information Security and Assurance"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23141-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T04:00:06Z","timestamp":1560484806000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23141-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642231407","9783642231414"],"references-count":78,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23141-4_3","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2011]]}}}