{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T03:59:42Z","timestamp":1780545582837,"version":"3.54.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T00:00:00Z","timestamp":1734307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T00:00:00Z","timestamp":1734307200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Science Foundation","award":["2312297"],"award-info":[{"award-number":["2312297"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10623-024-01542-3","type":"journal-article","created":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T18:34:16Z","timestamp":1734374056000},"page":"701-723","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Relating code equivalence to other isomorphism problems"],"prefix":"10.1007","volume":"93","author":[{"given":"Huck","family":"Bennett","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kaung Myat Htay","family":"Win","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,12,16]]},"reference":[{"key":"1542_CR1","unstructured":"Albrecht M.R., Bernstein D.J., Chou T., Cid C., Gilcher J., Lange T., Maram V., von Maurich I., Misoczki R., Niederhagen R., Paterson K.G., Persichetti E., Peters C., Schwabe P., Sendrier N., Szefer J., Tjhai C.J., Tomlinson M., Wang W.: Classic McEliece, 2022. NIST Post-Quantum Cryptography Standardization Project submission."},{"key":"1542_CR2","doi-asserted-by":"crossref","unstructured":"Babai L.: Graph isomorphism in quasipolynomial time. In: STOC (2016).","DOI":"10.1145\/2897518.2897542"},{"key":"1542_CR3","doi-asserted-by":"crossref","unstructured":"Barenghi A., Biasse J.-F., Persichetti E., Santini P.: LESS-FM: fine-tuning signatures from the code equivalence problem. In: PQCrypto (2021).","DOI":"10.1007\/978-3-030-81293-5_2"},{"issue":"1","key":"1542_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.3934\/amc.2022064","volume":"17","author":"A Barenghi","year":"2023","unstructured":"Barenghi A., Biasse J.-F., Persichetti E., Santini P.: On the computational hardness of the code equivalence problem in cryptography. Adv. Math. Commun. 17(1), 23\u201355 (2023).","journal-title":"Adv. Math. Commun."},{"key":"1542_CR5","doi-asserted-by":"crossref","unstructured":"Babai L., Codenotti P., Grochow J.A., Qiao Y.: Code equivalence and group isomorphism. In: SODA (2011).","DOI":"10.1137\/1.9781611973082.107"},{"key":"1542_CR6","unstructured":"Budroni A., Chi-Dom\u00ednguez J.-J., Kulkarni M.: Lattice isomorphism as a group action and hard problems on quadratic forms. IACR Cryptol. ePrint Arch., p. 1093 (2023)."},{"issue":"7","key":"1542_CR7","doi-asserted-by":"publisher","first-page":"1557","DOI":"10.1007\/s10623-022-01055-x","volume":"90","author":"S Ball","year":"2022","unstructured":"Ball S., Dixon J.: The equivalence of linear codes implies semi-linear equivalence. Des. Codes Cryptogr. 90(7), 1557\u20131565 (2022).","journal-title":"Des. Codes Cryptogr."},{"key":"1542_CR8","doi-asserted-by":"crossref","unstructured":"Beullens W.: Not enough LESS: an improved algorithm for solving code equivalence problems over $$\\mathbb{F} _q$$. In: SAC (2020).","DOI":"10.1007\/978-3-030-81652-0_15"},{"key":"1542_CR9","doi-asserted-by":"crossref","unstructured":"Bennett H., Ganju A., Peetathawatchai P., Stephens-Davidowitz N.: Just how hard are rotations of $$\\mathbb{Z} ^n$$? Algorithms and cryptography with the simplest lattice. In: EUROCRYPT (2023).","DOI":"10.1007\/978-3-031-30589-4_9"},{"key":"1542_CR10","doi-asserted-by":"crossref","unstructured":"Biasse J.-F., Micheli G: A search-to-decision reduction for the permutation code equivalence problem. In ISIT (2023).","DOI":"10.1109\/ISIT54713.2023.10206940"},{"key":"1542_CR11","doi-asserted-by":"crossref","unstructured":"Biasse J.-F., Micheli G., Persichetti E., Santini P.: LESS is more: code-based signatures without syndromes. In: AFRICACRYPT, vol. 12174, pp. 45\u201365. Springer (2020).","DOI":"10.1007\/978-3-030-51938-4_3"},{"key":"1542_CR12","doi-asserted-by":"crossref","unstructured":"Bardet M., Otmani A., Saeed-Taha M.: Permutation code equivalence is not harder than graph isomorphism when hulls are trivial. In: ISIT (2019).","DOI":"10.1109\/ISIT.2019.8849855"},{"issue":"2","key":"1542_CR13","doi-asserted-by":"publisher","first-page":"1244","DOI":"10.1137\/15M1054766","volume":"31","author":"K Chandrasekaran","year":"2017","unstructured":"Chandrasekaran K., Gandikota V., Grigorescu E.: Deciding orthogonality in construction-A lattices. SIAM J. Discret. Math. 31(2), 1244\u20131262 (2017).","journal-title":"SIAM J. Discret. Math."},{"key":"1542_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6568-7","volume-title":"Sphere Packings, Lattices, and Groups","author":"J Conway","year":"1999","unstructured":"Conway J., Sloane Neil J.A.: Sphere Packings, Lattices, and Groups. Springer, New York (1999)."},{"key":"1542_CR15","doi-asserted-by":"crossref","unstructured":"Ducas L., Gibbons S.: Hull attacks on the lattice isomorphism problem. In: PKC (2023).","DOI":"10.1007\/978-3-031-31368-4_7"},{"key":"1542_CR16","doi-asserted-by":"crossref","unstructured":"Ducas L., Postlethwaite E.W., Pulles L.N., van Woerden Wessel P.J.: Hawk: module LIP makes lattice signatures fast, compact and simple. In: ASIACRYPT (2022).","DOI":"10.1007\/978-3-031-22972-5_3"},{"issue":"267","key":"1542_CR17","doi-asserted-by":"publisher","first-page":"1713","DOI":"10.1090\/S0025-5718-09-02224-8","volume":"78","author":"M Dutour Sikiri\u0107","year":"2009","unstructured":"Dutour Sikiri\u0107 M., Sch\u00fcrmann A., Vallentin F.: Complexity and algorithms for computing Voronoi cells of lattices. Math. Comput. 78(267), 1713\u20131731 (2009).","journal-title":"Math. Comput."},{"key":"1542_CR18","doi-asserted-by":"crossref","unstructured":"Ducas L., van Woerden Wessel P.J.: On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography. In: EUROCRYPT (2022).","DOI":"10.1007\/978-3-031-07082-2_23"},{"key":"1542_CR19","unstructured":"Gotti F.: Matching and Hall\u2019s Theorem. Lecture Notes (2021). https:\/\/math.mit.edu\/~fgotti\/docs\/Courses\/Combinatorial%20Analysis\/30.%20Matchings%20and%20Hall%27s%20Theorem\/Matching%20and%20Hall%27s%20Theorem.pdf."},{"key":"1542_CR20","doi-asserted-by":"crossref","unstructured":"Grochow J.A.: Matrix isomorphism of matrix lie algebras. In: CCC (2012).","DOI":"10.1109\/CCC.2012.34"},{"key":"1542_CR21","unstructured":"Harada M., Munemasa A.: Database of self-dual codes (2015). https:\/\/www.math.is.tohoku.ac.jp\/~munemasa\/selfdualcodes.htm."},{"key":"1542_CR22","doi-asserted-by":"crossref","unstructured":"Haviv I., Regev O.: On the lattice isomorphism problem. In: SODA (2014).","DOI":"10.1137\/1.9781611973402.29"},{"issue":"1","key":"1542_CR23","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1006\/jcom.1995.1005","volume":"11","author":"L Khachiyan","year":"1995","unstructured":"Khachiyan L.: On the complexity of approximating extremal determinants in matrices. J. Complex. 11(1), 138\u2013153 (1995).","journal-title":"J. Complex."},{"issue":"242","key":"1542_CR24","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1090\/S0025-5718-02-01455-2","volume":"72","author":"OD King","year":"2003","unstructured":"King O.D.: A mass formula for unimodular lattices with no roots. Math. Comput. 72(242), 839\u2013863 (2003).","journal-title":"Math. Comput."},{"key":"1542_CR25","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. Springer-Verlag, Berlin (2006)."},{"key":"1542_CR26","unstructured":"McEliece R.J.: A public-key cryptosystem based on algebraic coding theory. DSN Progress Report (1978)."},{"key":"1542_CR27","volume-title":"Complexity of Lattice Problems\u2014A Cryptographic Perspective, Volume 671 of The Kluwer International Series in Engineering and Computer Science","author":"D Micciancio","year":"2002","unstructured":"Micciancio D., Goldwasser S.: Complexity of Lattice Problems\u2014A Cryptographic Perspective, Volume 671 of The Kluwer International Series in Engineering and Computer Science. Springer, New York (2002)."},{"issue":"4","key":"1542_CR28","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1017\/S0963548302005175","volume":"11","author":"JG Oxley","year":"2002","unstructured":"Oxley J.G., Welsh Dominic J.A.: Chromatic, flow and reliability polynomials: the complexity of their coefficients. Comb. Probab. Comput. 11(4), 403\u2013426 (2002).","journal-title":"Comb. Probab. Comput."},{"key":"1542_CR29","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566946.001.0001","volume-title":"Matroid Theory","author":"J Oxley","year":"2011","unstructured":"Oxley J.: Matroid Theory, 2nd edn Oxford University Press, Oxford (2011).","edition":"2"},{"issue":"5","key":"1542_CR30","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. Inf. Theory 43(5), 1602\u20131604 (1997).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1542_CR31","unstructured":"Rao R.: Personal communication (2024)."},{"key":"1542_CR32","unstructured":"Regev O.: Personal communication (2014)."},{"issue":"2","key":"1542_CR33","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/s00224-010-9260-0","volume":"49","author":"B Raghavendra Rao","year":"2011","unstructured":"Raghavendra Rao B., Sarma J.: On the complexity of matroid isomorphism problem. Theory Comput. Syst. 49(2), 246\u2013272 (2011) Preliminary version in CSR 2009.","journal-title":"Theory Comput. Syst."},{"key":"1542_CR34","unstructured":"Ran L., van Woerden W.: Personal communication (2024)."},{"issue":"4","key":"1542_CR35","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/18.850662","volume":"46","author":"N Sendrier","year":"2000","unstructured":"Sendrier N.: Finding the permutation between equivalent linear codes: the support splitting algorithm. IEEE Trans. Inf. Theory 46(4), 1193\u20131203 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1542_CR36","doi-asserted-by":"crossref","unstructured":"Sendrier N., Simos D.: How easy is code equivalence over $$\\mathbb{F}_q$$? In: International Workshop on Coding and Cryptography (WCC) (2013).","DOI":"10.1007\/978-3-642-38616-9_14"},{"key":"1542_CR37","doi-asserted-by":"crossref","unstructured":"Sendrier N., Simos D.E: The hardness of code equivalence over $$\\mathbb{F}_q$$ and its application to code-based cryptography. In: PQCrypto (2013). https:\/\/inria.hal.science\/hal-00790861v2.","DOI":"10.1007\/978-3-642-38616-9_14"},{"key":"1542_CR38","unstructured":"Tutte W.T.: Introduction to the theory of matroids. RAND Technical Report (1971)."},{"issue":"1","key":"1542_CR39","doi-asserted-by":"publisher","first-page":"245","DOI":"10.2307\/2371127","volume":"55","author":"H Whitney","year":"1933","unstructured":"Whitney H.: 2-isomorphic graphs. Am. J. Math. 55(1), 245\u2013254 (1933).","journal-title":"Am. J. Math."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01542-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01542-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01542-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T16:40:55Z","timestamp":1742229655000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01542-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,16]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["1542"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01542-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,16]]},"assertion":[{"value":"27 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 November 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}