{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T03:54:06Z","timestamp":1780545246065,"version":"3.54.1"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2244488"],"award-info":[{"award-number":["2244488"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSF","award":["2432132"],"award-info":[{"award-number":["2432132"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1109\/tit.2025.3637683","type":"journal-article","created":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T19:03:28Z","timestamp":1764183808000},"page":"1093-1108","source":"Crossref","is-referenced-by-count":1,"title":["Asymptotic Improvements to Provable Algorithms for the Code Equivalence Problem"],"prefix":"10.1109","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5469-8841","authenticated-orcid":false,"given":"Huck","family":"Bennett","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Colorado Boulder, Boulder, CO, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-8010-6976","authenticated-orcid":false,"given":"Drisana","family":"Bhatia","sequence":"additional","affiliation":[{"name":"Computer Science Division, University of California Berkeley, Berkeley, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8591-8408","authenticated-orcid":false,"given":"Jean-Fran\u00e7ois","family":"Biasse","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, University of South Florida, Tampa, FL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-0585-7435","authenticated-orcid":false,"given":"Medha","family":"Durisheti","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Virginia Polytechnic Institute and State University, Blacksburg, VA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-0422-8386","authenticated-orcid":false,"given":"Lucas","family":"LaBuff","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Maryland, College Park, MD, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8725-5473","authenticated-orcid":false,"given":"Vincenzo","family":"Pallozzi Lavorante","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, University of South Florida, Tampa, FL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-6481-2100","authenticated-orcid":false,"given":"Philip","family":"Waitkevich","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, University of South Florida, Tampa, FL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316385"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897542"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316356"},{"key":"ref4","article-title":"Additional digital signature schemes\u2013round 1 submissions","author":"Baldi","year":"2023"},{"key":"ref5","article-title":"Additional digital signature schemes\u2013round 1 submissions","author":"Bos","year":"2023"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1080\/23799927.2022.2048206"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-81293-5_2"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2022064"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.107"},{"key":"ref10","first-page":"109","article-title":"Not enough LESS: An improved algorithm for solving code equivalence problems over Fq","volume-title":"Proc. 27th Int. Conf. SAC","volume":"12804","author":"Beullens"},{"key":"ref11","first-page":"252","article-title":"Just how hard are rotations of Zn? Algorithms and cryptography with the simplest lattice","volume-title":"Proc. EUROCRYPT","author":"Bennett"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/261342.261346"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_31"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-79063-3_2"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206940"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51938-4_3"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849855"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-024-01542-3"},{"key":"ref19","article-title":"Additional digital signature schemes-round 1 submissions","author":"Chou","year":"2023"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-37679-5_2"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-025-01576-1"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-58754-2_6"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-22972-5_3"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-07082-2_23"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68391-6_6"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47721-7_12"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-36030-6_11"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056498"},{"key":"ref30","first-page":"114","article-title":"A public-key cryptosystem based on algebraic coding theory","volume-title":"Deep Space Netw. Prog. Rep.","volume":"44","author":"McEliece","year":"1978"},{"key":"ref31","first-page":"1","article-title":"Decoding random linear codes in $\\tilde{\\mathcal{O}}\\left(2^{0.054 n}\\right)$","volume-title":"Proc. 17th Int. Conf. Theory Appl. Cryptol. Inf. Secur.","volume":"7073","author":"May"},{"issue":"2","key":"ref32","first-page":"157","article-title":"Knapsack-type cryptosystems and algebraic coding theory","volume":"15","author":"Niederreiter","year":"1986","journal-title":"Problems Control Inf. Theory"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-86599-2_3"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12929-2_7"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/18.623157"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057777"},{"key":"ref37","article-title":"Algebraic approach for code equivalence","author":"Saeed-Taha","year":"2018"},{"key":"ref38","volume-title":"Lecture: Approximate Sampling of Spanning Trees Via Matroid Basis Exchange","author":"Schramm","year":"2022"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/18.850662"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38616-9_14"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/bfb0019850"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/BF02104746"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/11361350\/11269862-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11361350\/11269862.pdf?arnumber=11269862","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T20:58:05Z","timestamp":1769201885000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11269862\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":42,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2025.3637683","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2]]}}}