{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:42:22Z","timestamp":1773376942576,"version":"3.50.1"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195271","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Asymptotic Improvements to Provable Algorithms for the Code Equivalence Problem"],"prefix":"10.1109","author":[{"given":"Huck","family":"Bennett","sequence":"first","affiliation":[{"name":"University of Colorado Boulder"}]},{"given":"Drisana","family":"Bhatia","sequence":"additional","affiliation":[{"name":"University of California Berkeley"}]},{"given":"Jean-Francois","family":"Biasse","sequence":"additional","affiliation":[{"name":"University of South Florida"}]},{"given":"Medha","family":"Durisheti","sequence":"additional","affiliation":[{"name":"Virginia Tech"}]},{"given":"Lucas","family":"LaBuff","sequence":"additional","affiliation":[{"name":"University of Maryland at College Park"}]},{"given":"Vincenzo Pallozzi","family":"Lavorante","sequence":"additional","affiliation":[{"name":"University of South Florida"}]},{"given":"Philip","family":"Waitkevich","sequence":"additional","affiliation":[{"name":"University of South Florida"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.107"},{"key":"ref2","first-page":"203","article-title":"The hardness of code equivalence over and its application to code-based cryptography","volume-title":"PQCrypto 2013, ser. Lecture Notes in Computer Science","volume":"7932","author":"Sendrier","year":"2013"},{"key":"ref3","article-title":"An improved algorithm for code equivalence","author":"Nowakowski","year":"2024","journal-title":"Cryptology ePrint Archive, Paper 2024\/1272"},{"key":"ref4","first-page":"1533","article-title":"On linear equivalence, canonical forms, and digital signatures","author":"Chou","year":"2023","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref5","author":"Bennett","year":"2025","journal-title":"Asymptotic improvements to provable algorithms for the code equivalence problem (long version)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/tit.1982.1056498"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/tit.1962.1057777"},{"key":"ref8","first-page":"387","article-title":"Not enough LESS: an improved algorithm for solving code equivalence problems over Fq","volume-title":"SAC 2020, ser. Lecture Notes in Computer Science","volume":"12804","author":"Beullens","year":"2020"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2022064"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.850662"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/isit.2019.8849855"},{"key":"ref12","author":"Saeed-Taha","year":"2018","journal-title":"Algebraic approach to code equivalence"},{"key":"ref13","first-page":"114","article-title":"A Public-Key Cryptosystem Based On Algebraic Coding Theory","volume":"44","author":"McEliece","year":"1978","journal-title":"Deep Space Network Progress Report"},{"key":"ref14","first-page":"159","article-title":"Knapsack-Type Cryptosystems and Algebraic Coding Theory","volume":"15","author":"Niederreiter","year":"1986","journal-title":"Problems of Control and Information Theory"},{"key":"ref15","first-page":"45","article-title":"LESS is more: Code-based signatures without syndromes","volume-title":"AFRICACRYPT 2020, ser. Lecture Notes in Computer Science","volume":"12174","author":"Biasse","year":"2020"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47721-7_12"},{"key":"ref17","article-title":"Less","author":"Baldi","year":"2023","journal-title":"additional Digital Signature Schemes-Round 1 Submissions"},{"key":"ref18","first-page":"643","article-title":"On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography","volume-title":"EUROCRYPT 2022, ser. Lecture Notes in Computer Science","volume":"13277","author":"Ducas","year":"2022"},{"key":"ref19","first-page":"65","article-title":"Hawk: Module LIP makes lattice signatures fast, compact and simple","volume-title":"ASIACRYPT 2022, ser. Lecture Notes in Computer Science","volume":"13794","author":"Ducas","year":"2022"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-30589-4_9"},{"key":"ref21","first-page":"28","article-title":"Take your MEDS: digital signatures from matrix code equivalence","volume-title":"AFRICACRYPT 2023, ser. Lecture Notes in Computer Science","volume":"14064","author":"Chou","year":"2023"},{"key":"ref22","first-page":"251","article-title":"General linear group action on tensors: A candidate for post-quantum cryptography","volume-title":"TCC 2019, ser. Lecture Notes in Computer Science","volume":"11891","author":"Ji","year":"2019"},{"key":"ref23","article-title":"Hawk","author":"Bos","year":"2023","journal-title":"additional Digital Signature Schemes-Round 1 Submissions"},{"key":"ref24","article-title":"Meds","author":"Chou","year":"2023","journal-title":"additional Digital Signature Schemes-Round 1 Submissions"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2024.199.1.4"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/261342.261346"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897542"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/bf02104746"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316356"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195271.pdf?arnumber=11195271","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:29Z","timestamp":1773347369000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195271\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195271","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}