{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T20:49:17Z","timestamp":1777495757882,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540884026","type":"print"},{"value":"9783540884033","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-88403-3_3","type":"book-chapter","created":{"date-parts":[[2008,10,7]],"date-time":"2008-10-07T00:26:31Z","timestamp":1223339191000},"page":"31-46","source":"Crossref","is-referenced-by-count":208,"title":["Attacking and Defending the McEliece Cryptosystem"],"prefix":"10.1007","author":[{"given":"Daniel J.","family":"Bernstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tanja","family":"Lange","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christiane","family":"Peters","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Bard, G.V.: Accelerating cryptanalysis with the Method of Four Russians. Cryptology ePrint Archive: Report 2006\/251 (2006), \n                  \n                    http:\/\/eprint.iacr.org\/2006\/251"},{"key":"3_CR2","unstructured":"Bernstein, D.J.: List decoding for binary Goppa codes (2008), \n                  \n                    http:\/\/cr.yp.to\/papers.html#goppalist"},{"key":"3_CR3","unstructured":"Canteaut, A., Chabanne, H.: A further improvement of the work factor in an attempt at breaking McEliece\u2019s cryptosystem. In: Charpin, P. (ed.) EUROCODE 1994 (1994), \n                  \n                    http:\/\/www.inria.fr\/rrrt\/rr-2227.html"},{"issue":"1","key":"3_CR4","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 Transactions on Information Theory\u00a044(1), 367\u2013378 (1998)","journal-title":"IEEE Transactions on Information Theory"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-49649-1_16","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"A. Canteaut","year":"1998","unstructured":"Canteaut, A., Sendrier, N.: Cryptanalysis of the original McEliece cryptosystem. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 187\u2013199. Springer, Heidelberg (1998)"},{"key":"3_CR6","unstructured":"Engelbert, D., Overbeck, R., Schmidt, A.: A summary of McEliece-type cryptosystems and their security. Cryptology ePrint Archive: Report 2006\/162 (2006), \n                  \n                    http:\/\/eprint.iacr.org\/2006\/162"},{"key":"3_CR7","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_CR8","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"},{"issue":"1","key":"3_CR9","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1109\/18.272496","volume":"40","author":"Y.X. Li","year":"1994","unstructured":"Li, Y.X., Deng, R.H., Wang, X.M.: On the equivalence of McEliece\u2019s and Niederreiter\u2019s public-key cryptosystems. IEEE Transactions on Information Theory\u00a040(1), 271\u2013273 (1994)","journal-title":"IEEE Transactions on Information Theory"},{"key":"3_CR10","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory, Jet Propulsion Laboratory DSN Progress Report, 42\u201344 (1978), \n                  \n                    http:\/\/ipnpr.jpl.nasa.gov\/progress_report2\/42-44\/44N.PDF"},{"issue":"2","key":"3_CR11","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. Problemy Upravlenija i Teorii Informacii\u00a015(2), 159\u2013166 (1986)","journal-title":"Problems of Control and Information Theory. Problemy Upravlenija i Teorii Informacii"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Overbeck, R., Sendrier, N.: Code-based cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Introduction to post-quantum cryptography. Springer, Berlin (to appear)","DOI":"10.1007\/978-3-540-88702-7_4"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TIT.1975.1055350","volume":"IT-21","author":"N.J. Patterson","year":"1975","unstructured":"Patterson, N.J.: The algebraic decoding of Goppa codes. IEEE Transactions on Information Theory\u00a0IT-21, 203\u2013207 (1975)","journal-title":"IEEE Transactions on Information Theory"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF01776581","volume":"12","author":"N. Pippenger","year":"1979","unstructured":"Pippenger, N.: The minimum number of edges in graphs with prescribed paths. Mathematical Systems Theory\u00a012, 325\u2013346 (1979), \n                  \n                    http:\/\/cr.yp.to\/bib\/entries.html#1979\/pippenger","journal-title":"Mathematical Systems Theory"},{"key":"3_CR15","series-title":"Kluwer International Series in Engineering and Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-1-4757-3585-7_10","volume-title":"Information, coding and mathematics","author":"N. Sendrier","year":"2002","unstructured":"Sendrier, N.: On the security of the McEliece public-key cryptosystem. In: Blaum, M., Farrell, P.G., van Tilborg, H.C.A. (eds.) Information, coding and mathematics. Kluwer International Series in Engineering and Computer Science, vol.\u00a0687, pp. 141\u2013163. Kluwer, Dordrecht (2002)"},{"key":"3_CR16","first-page":"439","volume":"2","author":"V.M. Sidelnikov","year":"1992","unstructured":"Sidelnikov, V.M., Shestakov, S.O.: On insecurity of cryptosystems based on generalized Reed-Solomon codes. Discrete Mathematics and Applications\u00a02, 439\u2013444 (1992)","journal-title":"Discrete Mathematics and Applications"},{"key":"3_CR17","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: Cohen, G., Wolfmann, J. (eds.) Coding Theory and Applications 1988. LNCS, vol.\u00a0388, pp. 106\u2013113. Springer, Heidelberg (1989)"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/0-387-34799-2_10","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"J. Tilburg van","year":"1990","unstructured":"van Tilburg, J.: On the McEliece public-key cryptosystem. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 119\u2013131. Springer, Heidelberg (1990)"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88403-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,3]],"date-time":"2019-03-03T12:25:40Z","timestamp":1551615940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88403-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540884026","9783540884033"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88403-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}