{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:12Z","timestamp":1759638252790,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642254048"},{"type":"electronic","value":"9783642254055"}],"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-25405-5_3","type":"book-chapter","created":{"date-parts":[[2011,11,24]],"date-time":"2011-11-24T06:32:34Z","timestamp":1322116354000},"page":"35-50","source":"Crossref","is-referenced-by-count":22,"title":["Full Cryptanalysis of the Chen Identification Protocol"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Gaborit","sequence":"first","affiliation":[]},{"given":"Julien","family":"Schrek","sequence":"additional","affiliation":[]},{"given":"Gilles","family":"Z\u00e9mor","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"11","key":"3_CR1","doi-asserted-by":"publisher","first-page":"3016","DOI":"10.1109\/TIT.2003.819322","volume":"49","author":"T.P. Berger","year":"2003","unstructured":"Berger, T.P.: Isometries for rank distance and permutation group of gabidulin codes. IEEE Transactions on Information Theory\u00a049(11), 3016\u20133019 (2003)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"3_CR2","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 (Corresp.). IEEE Transactions on Information Theory\u00a024(3), 384\u2013386 (1978)","journal-title":"IEEE Transactions on Information Theory"},{"key":"3_CR3","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., El Yousfi Alaoui, S.M.: 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_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/BFb0034862","volume-title":"Advances in Cryptology - ASIACRYPT \u201996","author":"F. Chabaud","year":"1996","unstructured":"Chabaud, F., Stern, J.: The Cryptographic Security of the Syndrome Decoding Problem for Rank Distance Codes. In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol.\u00a01163, pp. 368\u2013381. Springer, Heidelberg (1996)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/BFb0032363","volume-title":"Cryptography: Policy and Algorithms","author":"K. Chen","year":"1996","unstructured":"Chen, K.: A New Identification Algorithm. In: Dawson, E.P., Goli\u0107, J.D. (eds.) Cryptography: Policy and Algorithms 1995. LNCS, vol.\u00a01029, pp. 244\u2013249. Springer, Heidelberg (1996)"},{"key":"3_CR6","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)"},{"issue":"1","key":"3_CR7","first-page":"3","volume":"21","author":"E.M. Gabidulin","year":"1985","unstructured":"Gabidulin, E.M.: Theory of Codes with Maximum Rank Distance. Probl. Peredachi Inf.\u00a021(1), 3\u201316 (1985)","journal-title":"Probl. Peredachi Inf."},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Gaborit, P., Girault, M.: Lightweight code-based authentification and signature. In: IEEE International Symposium on Information Theory, ISIT 2007, pp. 191\u2013195 (2007)","DOI":"10.1109\/ISIT.2007.4557225"},{"key":"3_CR9","unstructured":"Loidreau, P.: Properties of codes in rank metric. CoRR, abs\/cs\/0610057 (2006)"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1023\/A:1020369320078","volume":"38","author":"A.V. Ourivski","year":"2002","unstructured":"Ourivski, A.V., Johansson, T.: New technique for decoding codes in the rank metric and its cryptography applications. Probl. Inf. Transm.\u00a038, 237\u2013246 (2002)","journal-title":"Probl. Inf. Transm."},{"key":"3_CR11","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_CR12","unstructured":"Stein, W.A., et al.: Sage Mathematics Software (Version 3.3). The Sage\u00a0Group (2009), \n                  \n                    http:\/\/www.sagemath.org"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-48329-2_2","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"J. Stern","year":"1994","unstructured":"Stern, J.: A New Identification Scheme Based on Syndrome Decoding. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 13\u201321. Springer, Heidelberg (1994)"},{"key":"3_CR14","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)"},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s002000050053","volume":"8","author":"P. V\u00e9ron","year":"1996","unstructured":"V\u00e9ron, P.: Improved identification schemes based on error-correcting codes. Appl. Algebra Eng. Commun. Comput.\u00a08(1), 57\u201369 (1996)","journal-title":"Appl. Algebra Eng. Commun. Comput."}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25405-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:22:03Z","timestamp":1558297323000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25405-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642254048","9783642254055"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25405-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}