{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T22:21:57Z","timestamp":1780525317234,"version":"3.54.1"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T00:00:00Z","timestamp":1454284800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100000921","name":"COST European Project entitled Random Network Coding and Designs over GF(q)","doi-asserted-by":"publisher","award":["IC1104"],"award-info":[{"award-number":["IC1104"]}],"id":[{"id":"10.13039\/501100000921","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1109\/tit.2015.2511786","type":"journal-article","created":{"date-parts":[[2015,12,23]],"date-time":"2015-12-23T14:06:40Z","timestamp":1450879600000},"page":"1006-1019","source":"Crossref","is-referenced-by-count":84,"title":["On the Complexity of the Rank Syndrome Decoding Problem"],"prefix":"10.1109","volume":"62","author":[{"given":"Philippe","family":"Gaborit","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Olivier","family":"Ruatta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Julien","family":"Schrek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-007-9003-9"},{"key":"ref38","first-page":"178","article-title":"Extending Gibson’s attacks on the GPT cryptosystem","author":"overbeck","year":"2005","journal-title":"Proc WCC"},{"key":"ref33","article-title":"Properties of codes in rank metric","author":"loidreau","year":"2006"},{"key":"ref32","first-page":"142","article-title":"Designing a rank metric based McEliece cryptosystem","author":"loidreau","year":"2010","journal-title":"Proc 3rd Int PQCrypto"},{"key":"ref31","first-page":"1","article-title":"Algebraic decoding of rank metric codes","author":"levy-dit-vehel","year":"2006","journal-title":"Proc YACC"},{"key":"ref30","first-page":"267","article-title":"NTRU: A ring-based public key cryptosystem","author":"hoffstein","year":"1998","journal-title":"Proc 3rd Int ANTS"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020369320078"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.2307\/1989849"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_6"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44448-3_4"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5206029"},{"key":"ref11","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":"ref12","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0125"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0034862"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0032363"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1993.1051"},{"key":"ref16","first-page":"75","article-title":"A new efficient algorithm for computing Gröbner bases without reduction to zero ( $F_{5}$ )","author":"faug\u00e8re","year":"2002","journal-title":"Proceedings of the International Symposium on Symbolic and Algebraic Computing (ISSAC)"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_16"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2013.03.004"},{"key":"ref19","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":"Proceedings of the International Symposium on Symbolic and Algebraic Computing (ISSAC)"},{"key":"ref28","article-title":"On the hardness of the decoding and the minimum distance problems for rank codes","author":"philippe","year":"2014"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30556-9_18"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11659-4_6"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_31"},{"key":"ref6","first-page":"743","article-title":"Smaller decoding exponents: Ball-collision decoding","author":"bernstein","year":"2011","journal-title":"Proc 31st Annu Cryptol Conf"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25405-5_3"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1608"},{"key":"ref7","article-title":"Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal","author":"buchberger","year":"1965"},{"key":"ref2","first-page":"1","article-title":"Asymptotic behaviour of the index of regularity of quadratic semi-regular polynomial systems","author":"bardet","year":"2005","journal-title":"Proc Effective Methods Algebraic Geometry Conf (MEGA)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45682-1_24"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2014.09.025"},{"key":"ref20","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 WCC"},{"key":"ref22","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10366-7_6"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1002\/sec.228"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.820038"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513549"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-007-9160-8"},{"key":"ref26","first-page":"168","article-title":"Low rank parity check codes and their application to cryptography","author":"gaborit","year":"2013","journal-title":"Proc WCC"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258559"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46416-6_41"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7384825\/07364245.pdf?arnumber=7364245","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:46:35Z","timestamp":1641987995000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7364245\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2]]},"references-count":43,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2511786","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2]]}}}