{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T05:04:41Z","timestamp":1791090281564,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540618720","type":"print"},{"value":"9783540707073","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0034862","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T02:32:03Z","timestamp":1134268323000},"page":"368-381","source":"Crossref","is-referenced-by-count":47,"title":["The cryptographic security of the syndrome decoding problem for rank distance codes"],"prefix":"10.1007","author":[{"given":"F.","family":"Chabaud","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J.","family":"Stern","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,26]]},"reference":[{"issue":"3","key":"33_CR1","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"IT-24","author":"E.R. Berlekamp","year":"1978","unstructured":"E.R. Berlekamp, R.J. McEliece, and H.C.A. Van Tilborg. On the inherent intractability of certain coding problems. IEEE Trans. Inform. Theory, IT-24(3):384\u2013386, May 1978.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"19","key":"33_CR2","doi-asserted-by":"publisher","first-page":"1590","DOI":"10.1049\/el:19941106","volume":"30","author":"K. Chen","year":"1994","unstructured":"K. Chen. Improved Girault identification scheme. IEE Electronic Letters, 30(19):1590\u20131591, sep 1994.","journal-title":"IEE Electronic Letters"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"K. Chen. A new identification algorithm. In Cryptography Policy and Algorithms conference, volume 1029, pages 244\u2013249. LNCS, 1996.","DOI":"10.1007\/BFb0032363"},{"key":"33_CR4","volume-title":"Rapport de recherche","author":"F. Chabaud","year":"1996","unstructured":"F. Chabaud and R. Lercier. Zen: A new toolbox for finite extensions in finite fields. Rapport de recherche, Laboratoire d'Informatique de l'Ecole Polytechnique, 91128 Palaiseau Cedex, France, 1996. in preparation."},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"J.-B. Fischer and J. Stern. An efficient pseudo-random generator provably as secure as syndrome decoding. In Advances in Cryptology \u2014 EUROCRYPT '96, volume to appear. LNCS, 1996.","DOI":"10.1007\/3-540-68339-9_22"},{"key":"33_CR6","first-page":"1","volume":"21","author":"E.M. Gabidulin","year":"1985","unstructured":"E.M. Gabidulin. Theory of codes with maximum rank distance. Problems of Information Transmission, 21:1\u201312, 1985.","journal-title":"Problems of Information Transmission"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"M. Girault. A (non practical) three-pass identification protocol using coding theory. In Proc. Auscrypt'90, volume 453, pages 265\u2013272. LNCS, 1990.","DOI":"10.1007\/BFb0030367"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"S. Harari. A new authentication algorithm. In Coding Theory and Applications, volume 388, pages 204\u2013211. LNCS, 1989.","DOI":"10.1007\/BFb0019849"},{"key":"33_CR9","unstructured":"R. Lidl and H. Niederreiter. Finite fields. In Gian-Carlo Rota, editor, Encyclopedia of Mathematics and its applications. Addison-Wesley Publishing Company, 1983."},{"key":"33_CR10","unstructured":"F.J. MacWilliams and N.J.A. Sloane. The Theory of Error-correcting Codes. North-Holland, 1983."},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"J. Stern. A new paradigm for public key identification. IEEE Trans. Inform. Theory. to be published.","DOI":"10.1109\/18.556672"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"J. Stern. An alternative to the Fiat-Shamir protocol. In Advances in Cryptology \u2014 EUROCRYPT '89, pages 173\u2013180. LNCS, 1990.","DOI":"10.1007\/3-540-46885-4_19"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"J. Stern. A new identification scheme based on syndrome decoding. In Advances in Cryptology \u2014 CRYPTO '93, volume 773. LNCS, 1994.","DOI":"10.1007\/3-540-48329-2_2"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"P. V\u00e9ron. Cryptanalysis of Harari's identification scheme. In Cryptography and Coding, volume 1025, pages 264\u2013269. LNCS, 1995.","DOI":"10.1007\/3-540-60693-9_28"},{"key":"33_CR15","unstructured":"P. V\u00e9ron. Probl\u00e8me SD, Op\u00e9rateur Trace, Sch\u00e9mas d'identification et Codes de Goppa. PhD thesis, Universit\u00e9 de Toulon et du Var, juillet 1995."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT '96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0034862","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T09:51:20Z","timestamp":1586598680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0034862"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540618720","9783540707073"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0034862","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}