{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:18:37Z","timestamp":1772893117721,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642386152","type":"print"},{"value":"9783642386169","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38616-9_14","type":"book-chapter","created":{"date-parts":[[2013,6,4]],"date-time":"2013-06-04T07:55:16Z","timestamp":1370332516000},"page":"203-216","source":"Crossref","is-referenced-by-count":34,"title":["The Hardness of Code Equivalence over $\\mathbb{F}_q$ and Its Application to Code-Based Cryptography"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Sendrier","sequence":"first","affiliation":[]},{"given":"Dimitris E.","family":"Simos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Aguilar, C., Gaborit, P., Schrek, J.: A new zero-knowledge code based identification scheme with reduced communication. In: 2011 IEEE Information Theory Workshop (ITW), pp. 648\u2013652 (2011)","DOI":"10.1109\/ITW.2011.6089577"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Assmus, E.F.J., Key, J.D.: Designs and their Codes. Cambridge Tracts in Mathematics, vol.\u00a0103. Cambridge University Press (1992), second printing with corrections (1993)","DOI":"10.1017\/CBO9781316529836"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Babai, L., Codenotti, P., Grochow, J.A., Qiao, Y.: Code equivalence and group isomorphism. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, pp. 1395\u20131408. SIAM (2011)","DOI":"10.1137\/1.9781611973082.107"},{"key":"14_CR4","first-page":"23","volume":"30","author":"S. Barg","year":"1994","unstructured":"Barg, S.: Some new NP-complete coding problems. Probl. Peredachi Inf.\u00a030, 23\u201328 (1994)","journal-title":"Probl. Peredachi Inf."},{"key":"14_CR5","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, 384\u2013386 (1978)","journal-title":"IEEE Transactions on Information Theory"},{"key":"14_CR6","series-title":"Algorithms and Computation in Mathematics","volume-title":"Error-Correcting Linear Codes: Classification by Isometry and Applications","author":"A. Betten","year":"2006","unstructured":"Betten, A., Braun, M., Fripertinger, H., Kerber, A., Kohnert, A., Wassermann, A.: Error-Correcting Linear Codes: Classification by Isometry and Applications. Algorithms and Computation in Mathematics, vol.\u00a018. Springer, Heidelberg (2006)"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1142\/9789812772022_0009","volume":"3","author":"I. Bouyukliev","year":"2007","unstructured":"Bouyukliev, I.: About the code equivalence. Ser. Coding Theory Cryptol.\u00a03, 126\u2013151 (2007)","journal-title":"Ser. Coding Theory Cryptol."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Cayrel, P.L., Gaborit, P., Girault, M.: Identity-based identification and signature schemes using correcting codes. In: Augot, D., Sendrier, N., Tillich, J.P. (eds.) Workshop on Coding and Cryptography - WCC 2007, pp. 69\u201378. INRIA (2007)","DOI":"10.1109\/ISIT.2007.4557225"},{"key":"14_CR9","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":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-45682-1_10","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"N.T. Courtois","year":"2001","unstructured":"Courtois, N.T., Finiasz, M., Sendrier, N.: How to achieve a McEliece-based digital signature scheme. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 157\u2013174. Springer, Heidelberg (2001)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1007\/978-3-642-22792-9_43","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"H. Dinh","year":"2011","unstructured":"Dinh, H., Moore, C., Russell, A.: McEliece and niederreiter cryptosystems that resist quantum fourier sampling attacks. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 761\u2013779. Springer, Heidelberg (2011)"},{"key":"14_CR12","unstructured":"Dinh, H., Moore, C., Russell, A.: Quantum fourier sampling, code equivalence, and the quantum security of the mceliece and sidelnikov cryptosystems. Tech. rep. (2011), also available as arXiv:1111.4382v1"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"363","DOI":"10.3934\/amc.2009.3.363","volume":"3","author":"T. Feulner","year":"2009","unstructured":"Feulner, T.: The automorphism groups of linear codes and canonical representatives of their semilinear isometry classes. Adv. Math. Commun.\u00a03, 363\u2013383 (2009)","journal-title":"Adv. Math. Commun."},{"key":"14_CR14","first-page":"31","volume":"328","author":"H. Fripertinger","year":"1996","unstructured":"Fripertinger, H.: Enumeration of linear codes by applying methods from algebraic combinatorics. Grazer Math. Ber.\u00a0328, 31\u201342 (1996)","journal-title":"Grazer Math. Ber."},{"key":"14_CR15","first-page":"100","volume":"74","author":"H. Fripertinger","year":"2005","unstructured":"Fripertinger, H.: Enumeration of the semilinear isometry classes of linear codes. Bayrether Mathematische Schriften\u00a074, 100\u2013122 (2005)","journal-title":"Bayrether Mathematische Schriften"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/3-540-60114-7_15","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"H. Fripertinger","year":"1995","unstructured":"Fripertinger, H., Kerber, A.: Isometry classes of indecomposable linear codes. In: Giusti, M., Cohen, G., Mora, T. (eds.) AAECC 1995. LNCS, vol.\u00a0948, pp. 194\u2013204. Springer, Heidelberg (1995)"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BFb0030367","volume-title":"Advances in Cryptology - AUSCRYPT \u201990","author":"M. Girault","year":"1990","unstructured":"Girault, M.: A (non-practical) three-pass identification protocol using coding theory. In: Seberry, J., Pieprzyk, J. (eds.) AUSCRYPT 1990. LNCS, vol.\u00a0453, pp. 265\u2013272. Springer, Heidelberg (1990)"},{"key":"14_CR18","unstructured":"Grochow, J.A.: Matrix lie algebra isomorphism. Tech. Rep. TR11-168, Electronic Colloquium on Computational Complexity (2011), also available as arXiv:1112.2012, IEEE Conference on Computational Complexity (2012) (to appear)"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BFb0019849","volume-title":"Coding Theory and Applications","author":"S. Harari","year":"1989","unstructured":"Harari, S.: A new authentication algorithm. In: Wolfmann, J., Cohen, G. (eds.) Coding Theory 1988. LNCS, vol.\u00a0388, pp. 91\u2013105. Springer, Heidelberg (1989)"},{"key":"14_CR20","first-page":"1345","volume-title":"Handbook of Coding Theory","author":"W.C. Human","year":"1998","unstructured":"Human, W.C.: Codes and groups. In: Pless, V., Human, W.C. (eds.) Handbook of Coding Theory, pp. 1345\u20131440. Elsevier, North-Holland (1998)"},{"key":"14_CR21","series-title":"Algorithms and Computation in Mathematics","volume-title":"Classification Algorithms for Codes and Designs","author":"P. Kaski","year":"2006","unstructured":"Kaski, P., \u00d6sterg\u00e5rd, P.R.J.: Classification Algorithms for Codes and Designs. Algorithms and Computation in Mathematics, vol.\u00a015. Springer, Heidelberg (2006)"},{"key":"14_CR22","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1002\/j.1538-7305.1961.tb03986.x","volume":"40","author":"F.J. MacWilliams","year":"1961","unstructured":"MacWilliams, F.J.: Error-correcting codes for multiple-level transmission. Bell. Syst. Tech. J.\u00a040, 281\u2013308 (1961)","journal-title":"Bell. Syst. Tech. J."},{"key":"14_CR23","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Tech. Rep. DSN Progress Report 42-44, California Institute of Technology, Jet Propulsion Laboratory, Pasadena, CA (1978)"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Overbeck, R., Sendrier, N.: Code-based cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 95\u2013145. Springer (2009)","DOI":"10.1007\/978-3-540-88702-7_4"},{"key":"14_CR25","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 \n                  \n                    \n                  \n                  $\\mathbb{F}_q$\n                . In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol.\u00a06061, pp. 81\u201394. Springer, Heidelberg (2010)"},{"key":"14_CR26","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1109\/18.623157","volume":"43","author":"E. Petrank","year":"1997","unstructured":"Petrank, E., Roth, R.M.: Is code equivalence easy to decide? IEEE Trans. Inform. Theory\u00a043, 1602\u20131604 (1997)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"14_CR27","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1137\/S0895480195294027","volume":"10","author":"N. Sendrier","year":"1997","unstructured":"Sendrier, N.: On the dimension of the hull. SIAM J. Discrete Math.\u00a010(2), 282\u2013293 (1997)","journal-title":"SIAM J. Discrete Math."},{"key":"14_CR28","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/18.850662","volume":"26","author":"N. Sendrier","year":"2000","unstructured":"Sendrier, N.: Finding the permutation between equivalent linear codes: The support splitting algorithm. IEEE Trans. Inform. Theory\u00a026, 1193\u20131203 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"14_CR29","unstructured":"Sendrier, N., Simos, D.E.: How easy is code equivalence over \n                  \n                    \n                  \n                  $\\mathbb{F}_q$\n                ? In: WCC 2013: Proceedings of the 8th International Workshop on Coding and Cryptography (preprint 2012) (to appear, 2013), \n                  \n                    https:\/\/www.rocq.inria.fr\/secret\/PUBLICATIONS\/codeq3.pdf"},{"key":"14_CR30","unstructured":"Skersys, G.: Calcul du groupe d\u2019automorphisme des codes. D\u00e9termination de l\u2019 equivalence des codes. Th\u00e8se de doctorat, Universit\u00e9 de Limoges (October 1999)"},{"key":"14_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/3-540-46885-4_19","volume-title":"Advances in Cryptology - EUROCRYPT \u201989","author":"J. Stern","year":"1990","unstructured":"Stern, J.: An alternative to the fiat-shamir protocol. In: Quisquater, J.J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol.\u00a0434, pp. 173\u2013180. Springer, Heidelberg (1990)"},{"key":"14_CR32","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":"14_CR33","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":"14_CR34","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1006\/jctb.1998.1860","volume":"74","author":"D. Vertigan","year":"1998","unstructured":"Vertigan, D.: Bicycle dimension and special points of the Tutte polynomial. Journal of Combinatorial Theory, Series B\u00a074, 378\u2013396 (1998)","journal-title":"Journal of Combinatorial Theory, Series B"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38616-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T17:56:24Z","timestamp":1557770184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38616-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642386152","9783642386169"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38616-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}