{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:03:15Z","timestamp":1772283795430,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540651093","type":"print"},{"value":"9783540496496","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-49649-1_16","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T20:21:12Z","timestamp":1194985272000},"page":"187-199","source":"Crossref","is-referenced-by-count":41,"title":["Cryptanalysis of the Original McEliece Cryptosystem"],"prefix":"10.1007","author":[{"given":"Anne","family":"Canteaut","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Sendrier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,24]]},"reference":[{"issue":"1","key":"16_CR1","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1109\/18.651067","volume":"IT-44","author":"A. Canteaut","year":"1998","unstructured":"A. Canteaut and F. Chabaud. A new algorithm for finding minimum-weight words in a linear code: application to McEliece\u2019s cryptosystem and to narrowsense BCH codes of length 511. IEEE Transactions on Information Theory, IT-44(1):367\u2013378, 1998.","journal-title":"IEEE Transactions on Information Theory"},{"key":"16_CR2","unstructured":"J.G. Kemeny and J.L. Snell. Finite Markov chains. Springer-Verlag, 1960."},{"key":"16_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","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":"P.J. Lee and E.F. Brickell. An observation on the security of McEliece\u2019s public-key cryptosystem. In C.G. G\u00fcnter, ed., Advances in Cryptology-EUROCRYPT\u201988, number 330 in Lecture Notes in Computer Science, pages 275\u2013280. Springer-Verlag, 1988."},{"issue":"1","key":"16_CR4","first-page":"271","volume":"IT-40","author":"Y.X. Li","year":"1994","unstructured":"Y.X. Li, R.H. Deng, and X.M. Wang. On the equivalence of McEliece\u2019s and Niederreiter\u2019s public-key cryptosystems. IEEE Transactions on Information Theory, IT-40(1):271\u2013273, 1994.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"16_CR5","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1109\/18.21270","volume":"34","author":"J.S. Leon","year":"1988","unstructured":"J.S. Leon. A probabilistic algorithm for computing minimum weights of large error-correcting codes. IEEE Transactions on Information Theory, 34(5):1354\u20131359, 1988.","journal-title":"IEEE Transactions on Information Theory"},{"key":"16_CR6","unstructured":"R.J. McEliece. A public-key cryptosystem based on algebraic coding theory. JPL DSN Progress Report, pages 114\u2013116, 1978."},{"issue":"2","key":"16_CR7","first-page":"159","volume":"15","author":"H. Niederreiter","year":"1986","unstructured":"H. Niederreiter. Knapsack-type cryptosystems and algebraic coding theory. Problems of Control and Information Theory, 15(2):159\u2013166, 1986.","journal-title":"Problems of Control and Information Theory"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"J.K. Omura. Iterative decoding of linear codes by a modulo-2 linear programm. Discrete Math, (3):193\u2013208, 1972.","DOI":"10.1016\/0012-365X(72)90033-7"},{"key":"16_CR9","unstructured":"N. Sendrier. On the structure of a randomly permuted concatenated code. In P. Charpin, ed., EUROCODE 94-Livre des r\u00e9sum\u00e9s, pages 169\u2013173. INRIA, 1994."},{"key":"16_CR10","unstructured":"N. Sendrier. On the structure of a randomly permuted concatenated code. Technical Report RR-2460, INRIA, January 1995."},{"key":"16_CR11","unstructured":"N. Sendrier. An algorithm for finding the permutation between two equivalent binary codes. Technical Report RR-2853, INRIA, April 1996."},{"key":"16_CR12","first-page":"57","volume":"4","author":"V.M. Sidelnikov","year":"1992","unstructured":"V.M. Sidelnikov and S.O. Shestakov. On cryptosystems based on generalized Reed-Solomon codes. Diskretnaya Math, 4:57\u201363, 1992.","journal-title":"Diskretnaya Math"},{"key":"16_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/BFb0019850","volume-title":"Coding Theory and Applications","author":"J. Stern","year":"1989","unstructured":"J. Stern. A method for finding codewords of small weight. In G. Cohen and J. Wolfmann, eds., Coding Theory and Applications, number 388 in Lecture Notes in Computer Science, pages 106\u2013113. Springer-Verlag, 1989."},{"key":"16_CR14","series-title":"Lect Notes Comput Sci","first-page":"13","volume-title":"Advances in Cryptology-CRYPTO\u201993","author":"J. Stern","year":"1993","unstructured":"J. Stern. A new identification scheme based on syndrome decoding. In D.R. Stinson, ed., Advances in Cryptology-CRYPTO\u201993, number 773 in Lecture Notes in Computer Science, pages 13\u201321. Springer-Verlag, 1993."},{"key":"16_CR15","unstructured":"P. V\u00e9ron. Probleme SD, Op\u00e9rateur Trace, sch\u00e9mas d\u2019identification et codes de Goppa. PhD thesis, Universit\u00e9 de Toulon et du Var, 1995."},{"key":"16_CR16","unstructured":"J. van Tilburg. Security-analysis of a class of cryptosystems based on linear error-correcting codes. PhD thesis, Technische Universiteit Eindhoven, 1994."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT\u201998"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49649-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T08:11:08Z","timestamp":1551082268000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49649-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540651093","9783540496496"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-49649-1_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}