{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T21:37:04Z","timestamp":1780090624355,"version":"3.54.0"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"French DGA"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1109\/tit.2019.2933535","type":"journal-article","created":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T20:09:49Z","timestamp":1565381389000},"page":"7697-7717","source":"Crossref","is-referenced-by-count":37,"title":["Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography"],"prefix":"10.1109","volume":"65","author":[{"given":"Nicolas","family":"Aragon","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4034-521X","authenticated-orcid":false,"given":"Philippe","family":"Gaborit","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adrien","family":"Hauteville","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Olivier","family":"Ruatta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6041-9554","authenticated-orcid":false,"given":"Gilles","family":"Zemor","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","first-page":"257","article-title":"Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology","author":"faug\u00e8re","year":"2010","journal-title":"Proc ISSAC"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_16"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70500-2_12"},{"key":"ref32","first-page":"177","article-title":"Hybrid approach for solving multivariate systems over finite fields","volume":"3","author":"bettale","year":"2010","journal-title":"J Math Cryptol"},{"key":"ref31","article-title":"Algebraic decoding of codes in rank metric","author":"l\u00e9vy-dit vehel","year":"2006","journal-title":"Proc YACC"},{"key":"ref30","author":"aragon","year":"2017","journal-title":"Improvement of Generic Attacks on the Rank Syndrome Decoding Problem"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437464"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2511786"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020369320078"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0034862"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054868"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_1"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29360-8_2"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_8"},{"key":"ref13","first-page":"81","article-title":"Shorter keys for code based cryptography","author":"gaborit","year":"2005","journal-title":"Proc Workshop on Coding and Cryptography (WCC)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s11786-009-0015-8"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05445-7_24"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_14"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2007.161"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85855-3_17"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1049\/iet-ifs.2012.0127"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46416-6_41"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282956"},{"key":"ref3","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref27","first-page":"114","article-title":"A public-key cryptosystem based on algebraic coding theory","author":"mceliece","year":"1978"},{"key":"ref6","first-page":"304","article-title":"A new public-key cryptosystem based on the problem of reconstructing p–polynomials","author":"faure","year":"2005","journal-title":"Proc Workshop on Coding and Cryptography (WCC)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-007-9003-9"},{"key":"ref29","article-title":"A polynomial attack on a NIST proposal: Ranksign, a code-based signature in rank metric","author":"debris-alazard","year":"2018","journal-title":"IACR Cryptology ePrint"},{"key":"ref8","first-page":"193","article-title":"Permutation decoding: Towards an approach using algebraic properties of the \n$\\sigma$\n-subcode","author":"legeay","year":"2011","journal-title":"WCC"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30556-9_18"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02384-2_6"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-007-9160-8"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55220-5_1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"ref22","first-page":"234","article-title":"On cellular codes and their cryptographic applications","author":"loidreau","year":"2014","journal-title":"Proc Int Workshop on Algebr Combinator Coding Theory (ACCT)"},{"key":"ref21","first-page":"1","article-title":"Low rank parity check codes and their application to cryptography","author":"gaborit","year":"2013","journal-title":"Proc Workshop on Coding and Cryptography (WCC)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.2307\/1989849"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2616127"},{"key":"ref41","article-title":"LOCKER—LOw rank parity ChecK codes EncRyption","author":"aragon","year":"2017","journal-title":"Proc 1st Round Submission NIST Post-Quantum Cryptogr Call"},{"key":"ref26","article-title":"Properties of codes in rank metric","author":"loidreau","year":"2006","journal-title":"arXiv cs\/0610057"},{"key":"ref25","article-title":"Décodage en métrique rang et attaques sur un système de chiffrement à base de codes LRPC","author":"hauteville","year":"2014"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8907537\/08793239.pdf?arnumber=8793239","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:41:28Z","timestamp":1657744888000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8793239\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":41,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2019.2933535","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12]]}}}