{"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":1780545582673,"version":"3.54.1"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"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","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206940","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"602-607","source":"Crossref","is-referenced-by-count":6,"title":["A Search-to-Decision Reduction for the Permutation Code Equivalence Problem"],"prefix":"10.1109","author":[{"given":"Jean-Fran\u00e7ois","family":"Biasse","sequence":"first","affiliation":[{"name":"University of South Florida,Center for Cryptographic Research,Tampa,FL,USA,33620"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giacomo","family":"Micheli","sequence":"additional","affiliation":[{"name":"University of South Florida,Center for Cryptographic Research,Tampa,FL,USA,33620"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.850662"},{"key":"ref12","article-title":"Not enough LESS: an improved algorithm for solving code equivalence problems over ${\\mathbb{F}_q}$","volume":"12804","author":"beullens","year":"2020","journal-title":"Selected Areas in Cryptography-SAC 2020-27th International Conference"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897542"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849855"},{"key":"ref20","article-title":"Take your MEDS: Digital signatures from matrix code equivalence","author":"chou","year":"2022"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2022064"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056498"},{"key":"ref21","author":"k\u00f6bler","year":"1993","journal-title":"The Graph Isomorphism Problem Its Structural Complexity ser Progress in Theoretical Computer Science"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0030367"},{"key":"ref1","first-page":"114","article-title":"A public-key cryptosystem based on algebraic coding theory","volume":"42","author":"mceliece","year":"1978","journal-title":"DSN progress report"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.623157"},{"key":"ref16","article-title":"Approche algeébrique sur l’équivalence des codes","author":"saeed-taha","year":"2017","journal-title":"Ph D Dissertation"},{"key":"ref19","article-title":"Hardness estimates of the code equivalence problem in the rank metric","author":"reijnders","year":"2022"},{"key":"ref18","article-title":"On the hardness of code equivalence problems in rank metric","author":"couvreur","year":"2020"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-81293-5_2"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03332-3_15"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1080\/23799927.2022.2048206"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51938-4_3"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38616-9_14"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64834-3_14"},{"key":"ref5","first-page":"291","article-title":"Hard homogeneous spaces","author":"couveignes","year":"2006","journal-title":"IACR Cryptol ePrint Arch"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206940.pdf?arnumber=10206940","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:28:03Z","timestamp":1773347283000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206940\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206940","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}