{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:46:26Z","timestamp":1730274386382,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437561","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T20:14:55Z","timestamp":1534536895000},"page":"2426-2430","source":"Crossref","is-referenced-by-count":10,"title":["Repairing the Faure-Loidreau Public-Key Cryptosystem"],"prefix":"10.1109","author":[{"given":"Antonia","family":"Wachter-Zeh","sequence":"first","affiliation":[]},{"given":"Sven","family":"Puchinger","sequence":"additional","affiliation":[]},{"given":"Julian","family":"Renner","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Finite Fields Ser Encyclopedia of Mathematics and Its Applications","year":"1996","author":"lidl","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90015-8"},{"key":"ref12","first-page":"186","article-title":"Decoding rank errors beyond the error correcting capability","author":"loidreau","year":"2006","journal-title":"Int Workshop Alg Combin Coding Theory (ACCT)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2096032"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-014-9953-5"},{"journal-title":"Improvement of Generic Attacks on the Rank Syndrome Decoding Problem","year":"2017","author":"aragon","key":"ref15"},{"journal-title":"Decoding of Block and Convolutional Codes in Rank Metric","year":"2013","author":"wachter-zeh","key":"ref16"},{"journal-title":"Public key cryptography based on coding theory","year":"2007","author":"overbeck","key":"ref17"},{"journal-title":"Personal communication","year":"0","author":"rosenkilde","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034058"},{"key":"ref4","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Probl Inf Transm"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39200-9_14"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2532343"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2274653"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/11554868_5"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2511786"},{"key":"ref2","article-title":"M&#x00E9;trique rang et cryptographie (in French)","author":"loidreau","year":"2007","journal-title":"M&#x00E9;moire d'Habilitation &#x00E0; Diriger des Recherches Universit&#x00E9; Pierre et Marie Curie"},{"key":"ref9","article-title":"Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes","author":"gaborit","year":"2017","journal-title":"Preprint"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/11779360_24"},{"key":"ref20","article-title":"An evolution of GPT cryptosystem","author":"loidreau","year":"2016","journal-title":"ACCT"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620590"},{"journal-title":"8th Int Conf on Post-Quantum Cryptography (PQCrypto)","article-title":"A new rank metric codes based encryption scheme","year":"2017","key":"ref21"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO, USA","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437561.pdf?arnumber=8437561","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T00:42:51Z","timestamp":1598229771000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437561\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437561","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}