{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T00:32:48Z","timestamp":1787013168104,"version":"3.56.0"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Plan France 2030 Program"},{"DOI":"10.13039\/501100001665","name":"French Agence Nationale de la Recherche project","doi-asserted-by":"publisher","award":["ANR-22-PETQ-0008 PQ-TLS"],"award-info":[{"award-number":["ANR-22-PETQ-0008 PQ-TLS"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1109\/tit.2023.3334592","type":"journal-article","created":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T14:06:39Z","timestamp":1701180399000},"page":"4492-4511","source":"Crossref","is-referenced-by-count":11,"title":["Polynomial Time Key-Recovery Attack on High Rate Random Alternant Codes"],"prefix":"10.1109","volume":"70","author":[{"given":"Magali","family":"Bardet","sequence":"first","affiliation":[{"name":"LITIS UR 4108, University of Rouen Normandie, Rouen, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5165-5320","authenticated-orcid":false,"given":"Rocco","family":"Mora","sequence":"additional","affiliation":[{"name":"CISPA—Helmholtz Center for Information Security, Sankt Ingbert, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1709-1792","authenticated-orcid":false,"given":"Jean-Pierre","family":"Tillich","sequence":"additional","affiliation":[{"name":"INRIA, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"114","volume-title":"A Public-Key System Based on Algebraic Coding Theory","author":"McEliece","year":"1978"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"ref4","volume-title":"Classic McEliece (Merger of Classic McEliece and NTS-KEM)","author":"Albrecht","year":"2022"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59879-6_5"},{"key":"ref6","first-page":"8","article-title":"Optimizing BJMM with nearest neighbors: Full decoding in 22n\/21 and McEliece security","volume-title":"Proc. Workshop Coding Cryptogr.","author":"Both"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0019850"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.651067"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/978-3-642-25385-0_6","article-title":"Decoding random linear codes in O(20.054n)","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2011","volume":"7073","author":"May","year":"2011"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_31"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_9"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.915687"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.850662"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45682-1_10"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19574-7_10"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25405-5_16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02384-2_6"},{"key":"ref18","volume-title":"Big Quake","author":"Couvreur","year":"2017"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05445-7_24"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25405-5_12"},{"key":"ref21","volume-title":"DAGS: Key Encapsulation for Dyadic GS Codes","author":"Banegas","year":"2017"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_14"},{"key":"ref23","first-page":"5","article-title":"Practical key recovery attacks on two McEliece variants","author":"Gauthier-Uma\u00f1a","year":"2009","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2011.6089437"},{"key":"ref25","first-page":"9","article-title":"Error-correcting pairs for a public-key cryptosystem","volume-title":"Proc. Code-based Cryptogr. Workshop","author":"M\u00e1rquez-Corbella"},{"key":"ref26","article-title":"On the dimension and structure of the square of the dual of a Goppa code","author":"Mora","year":"2021","journal-title":"arXiv:2111.13038"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-014-9967-z"},{"issue":"2","key":"ref28","first-page":"159","article-title":"Knapsack-type cryptosystems and algebraic coding theory","volume":"15","author":"Niederreiter","year":"1986","journal-title":"Problems Control Inf. Theory"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1515\/dma.1992.2.4.439"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2393251"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2712636"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2014.04.007"},{"key":"ref33","volume-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1986"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2272036"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055435"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511807077"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/637\/12749"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1006\/ffta.2000.0277"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(87)90060-4"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1993.1051"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2574841"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-022-01153-w"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10536118\/10330622.pdf?arnumber=10330622","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T01:47:17Z","timestamp":1716428837000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10330622\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6]]},"references-count":42,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2023.3334592","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6]]}}}