{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:00:36Z","timestamp":1773378036626,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518250","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"1260-1265","source":"Crossref","is-referenced-by-count":1,"title":["Fast and Secure Key Generation for Low Rank Parity Check Codes Cryptosystems"],"prefix":"10.1109","author":[{"given":"Carlos","family":"Aguilar-Melchor","sequence":"first","affiliation":[{"name":"ISAE-SUPAERO, Université de Toulouse,France"}]},{"given":"Nicolas","family":"Aragon","sequence":"additional","affiliation":[{"name":"XLIM, Université de Limoges,France"}]},{"given":"Victor","family":"Dyseryn","sequence":"additional","affiliation":[{"name":"XLIM, Université de Limoges,France"}]},{"given":"Philippe","family":"Gaborit","sequence":"additional","affiliation":[{"name":"XLIM, Université de Limoges,France"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Status report on the second round of the nist post-quantum cryptography standardization process","author":"alagic","year":"0","journal-title":"US Department of Commerce NIST SP"},{"key":"ref11","year":"0","journal-title":"Rank-based cryptography library"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44709-1_24"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(88)90024-7"},{"key":"ref14","author":"aguilar-melchor","year":"0","journal-title":"Constant time algorithms for rollo-i-128"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-49785-9_8"},{"key":"ref16","author":"gao","year":"1993","journal-title":"Normal Bases over Finite Fields"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45600-7_21"},{"key":"ref18","author":"bernstein","year":"2010","journal-title":"ebacs Ecrypt benchmarking of cryptographic systems Supercop"},{"key":"ref19","year":"0","journal-title":"Valgrind"},{"key":"ref4","article-title":"Hamming quasi-cyclic (hqc)","author":"melchor","year":"2020","journal-title":"NIST POST-QUANTUM CRYPTO PROJECT"},{"key":"ref3","article-title":"Bike: bit flipping key encapsulation","author":"aragon","year":"2020","journal-title":"NIST POST-QUANTUM CRYPTO PROJECT"},{"key":"ref6","author":"melchor","year":"2019","journal-title":"Rank quasi-cyclic (rqc)"},{"key":"ref5","article-title":"Rollo (merger of rank-ouroboros, lake and locker)","author":"aragon","year":"2019","journal-title":"NIST POST-QUANTUM CRYPTO PROJECT"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45727-3_3"},{"key":"ref7","article-title":"Low rank parity check codes and their application to cryptography","volume":"2013","author":"gaborit","year":"0","journal-title":"Proceedings of the Workshop on Coding and Cryptography WCC"},{"key":"ref2","article-title":"Classic mceliece: conservative code-based cryptography","author":"chou","year":"2020","journal-title":"NIST POST-QUANTUM CRYPTO PROJECT"},{"key":"ref1","year":"0","journal-title":"Nist-post-quantum cryptography"},{"key":"ref9","first-page":"507","article-title":"Improvements of algebraic attacks for solving the rank decoding and minrank problems","author":"bardet","year":"2020","journal-title":"International Conference on the Theory and Application of Cryptology and Information Security"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518250.pdf?arnumber=9518250","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:00Z","timestamp":1773347760000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518250\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518250","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}