{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:53:09Z","timestamp":1765961589548,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031172335"},{"type":"electronic","value":"9783031172342"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-17234-2_3","type":"book-chapter","created":{"date-parts":[[2022,9,25]],"date-time":"2022-09-25T21:02:18Z","timestamp":1664139738000},"page":"45-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["LRPC Codes with\u00a0Multiple Syndromes: Near Ideal-Size KEMs Without Ideals"],"prefix":"10.1007","author":[{"given":"Carlos","family":"Aguilar-Melchor","sequence":"first","affiliation":[]},{"given":"Nicolas","family":"Aragon","sequence":"additional","affiliation":[]},{"given":"Victor","family":"Dyseryn","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Gaborit","sequence":"additional","affiliation":[]},{"given":"Gilles","family":"Z\u00e9mor","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,21]]},"reference":[{"key":"3_CR1","unstructured":"Aguilar Melchor, C., et al.: HQC. Round 3 Submission to the NIST Post-Quantum Cryptography Call (2021). https:\/\/pqc-hqc.org\/"},{"key":"3_CR2","unstructured":"Aguilar Melchor, C., et al.: Rank quasi cyclic (RQC). First round submission to the NIST post-quantum cryptography call (2017). https:\/\/pqc-rqc.org\/"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Alagic, G., et al.: Status report on the second round of the NIST post-quantum cryptography standardization process. US Department of Commerce, NIST (2020)","DOI":"10.6028\/NIST.IR.8240"},{"key":"3_CR4","unstructured":"Albrecht, M.R., et al.: Classic McEliece: conservative code-based cryptography. Third round submission to the NIST post-quantum cryptography call (2020). https:\/\/classic.mceliece.org\/"},{"key":"3_CR5","unstructured":"Alkim, E., et al.: FrodoKEM - learning with errors key encapsulation. Third round submission to the NIST post-quantum cryptography call (2021). https:\/\/frodokem.org\/"},{"key":"3_CR6","unstructured":"Aragon, N., et al.: BIKE (2017). https:\/\/bikesuite.org\/, NIST Round 1 submission for Post-Quantum Cryptography"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Aragon, N., Gaborit, P., Hauteville, A., Tillich, J.P.: A new algorithm for solving the rank syndrome decoding problem. In: Proceedings of the IEEE ISIT (2018)","DOI":"10.1109\/ISIT.2018.8437464"},{"key":"3_CR8","unstructured":"Aragon, N., et al.: ROLLO (merger of Rank-Ouroboros, LAKE and LOCKER). Second round submission to the NIST post-quantum cryptography call (2019). https:\/\/pqc-rollo.org\/"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1007\/978-3-030-17659-4_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"N Aragon","year":"2019","unstructured":"Aragon, N., Blazy, O., Gaborit, P., Hauteville, A., Z\u00e9mor, G.: Durandal: a rank metric based signature scheme. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 728\u2013758. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_25"},{"issue":"12","key":"3_CR10","doi-asserted-by":"publisher","first-page":"7697","DOI":"10.1109\/TIT.2019.2933535","volume":"65","author":"N Aragon","year":"2019","unstructured":"Aragon, N., Gaborit, P., Hauteville, A., Ruatta, O., Z\u00e9mor, G.: Low rank parity check codes: new decoding algorithms and applications to cryptography. IEEE Trans. Inf. Theory 65(12), 7697\u20137717 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR11","unstructured":"Avanzi, R., et al.: Crystals-kyber. Third round submission to the NIST post-quantum cryptography call (2021). https:\/\/pq-crystals.org\/kyber\/"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-55220-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"R Barbulescu","year":"2014","unstructured":"Barbulescu, R., Gaudry, P., Joux, A., Thom\u00e9, E.: A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 1\u201316. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_1"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-030-81293-5_23","volume-title":"Post-Quantum Cryptography","author":"M Bardet","year":"2021","unstructured":"Bardet, M., Briaud, P.: An algebraic approach to the rank support learning problem. In: Cheon, J.H., Tillich, J.-P. (eds.) PQCrypto 2021 2021. LNCS, vol. 12841, pp. 442\u2013462. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_23"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-45727-3_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"M Bardet","year":"2020","unstructured":"Bardet, M., et al.: An algebraic attack on rank metric code-based cryptosystems. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 64\u201393. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_3"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-030-64837-4_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"M Bardet","year":"2020","unstructured":"Bardet, M., et al.: Improvements of algebraic attacks for solving the rank decoding and MinRank problems. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12491, pp. 507\u2013536. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_17"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-540-30556-9_18","volume-title":"Progress in Cryptology - INDOCRYPT 2004","author":"T Berger","year":"2004","unstructured":"Berger, T., Loidreau, P.: Designing an efficient and secure public-key cryptosystem based on reducible rank codes. In: Canteaut, A., Viswanathan, K. (eds.) INDOCRYPT 2004. LNCS, vol. 3348, pp. 218\u2013229. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30556-9_18"},{"issue":"3","key":"3_CR17","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1006\/jcss.1998.1608","volume":"58","author":"JF Buss","year":"1999","unstructured":"Buss, J.F., Frandsen, G.S., Shallit, J.O.: The computational complexity of some problems of linear algebra. J. Comput. Syst. Sci. 58(3), 572\u2013596 (1999)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Chou, T., Liou, J.H.: A constant-time AVX2 implementation of a variant of ROLLO. IACR Trans. Cryptographic Hardw. Embed. Syst. 152\u2013174 (2022)","DOI":"10.46586\/tches.v2022.i1.152-174"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-030-03326-2_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"T Debris-Alazard","year":"2018","unstructured":"Debris-Alazard, T., Tillich, J.-P.: Two attacks on rank metric code-based schemes: RankSign and an IBE scheme. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11272, pp. 62\u201392. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03326-2_3"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-319-59879-6_2","volume-title":"Post-Quantum Cryptography","author":"J-C Deneuville","year":"2017","unstructured":"Deneuville, J.-C., Gaborit, P., Z\u00e9mor, G.: Ouroboros: a simple, secure and efficient key exchange protocol based on coding theory. In: Lange, T., Takagi, T. (eds.) PQCrypto 2017. LNCS, vol. 10346, pp. 18\u201334. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59879-6_2"},{"key":"3_CR21","unstructured":"Elleuch, M., Wachter-Zeh, A., Zeh, A.: A public-key cryptosystem from interleaved Goppa codes. arXiv preprint arXiv:1809.03024 (2018)"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/11779360_24","volume-title":"Coding and Cryptography","author":"C Faure","year":"2006","unstructured":"Faure, C., Loidreau, P.: A new public-key cryptosystem based on the problem of reconstructing p\u2013polynomials. In: Ytrehus, \u00d8. (ed.) WCC 2005. LNCS, vol. 3969, pp. 304\u2013315. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11779360_24"},{"issue":"1","key":"3_CR23","first-page":"3","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin, E.M.: Theory of codes with maximum rank distance. Problemy Peredachi Informatsii 21(1), 3\u201316 (1985)","journal-title":"Problemy Peredachi Informatsii"},{"issue":"2","key":"3_CR24","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10623-007-9160-8","volume":"48","author":"EM Gabidulin","year":"2008","unstructured":"Gabidulin, E.M.: Attacks and counter-attacks on the GPT public key cryptosystem. Des. Codes Cryptogr. 48(2), 171\u2013177 (2008)","journal-title":"Des. Codes Cryptogr."},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/3-540-46416-6_41","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201991","author":"EM Gabidulin","year":"1991","unstructured":"Gabidulin, E.M., Paramonov, A.V., Tretjakov, O.V.: Ideals over a non-commutative ring and their application in cryptology. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 482\u2013489. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_41"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-319-63697-9_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"P Gaborit","year":"2017","unstructured":"Gaborit, P., Hauteville, A., Phan, D.H., Tillich, J.-P.: Identity-based encryption from codes with rank metric. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10403, pp. 194\u2013224. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_7"},{"key":"3_CR27","unstructured":"Gaborit, P., Murat, G., Ruatta, O., Z\u00e9mor, G.: Low rank parity check codes and their application to cryptography. In: Proceedings of the Workshop on Coding and Cryptography WCC, vol. 2013 (2013)"},{"key":"3_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-06734-6_1","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2014","author":"P Gaborit","year":"2014","unstructured":"Gaborit, P., Ruatta, O., Schrek, J., Z\u00e9mor, G.: New results for rank-based cryptography. In: Pointcheval, D., Vergnaud, D. (eds.) AFRICACRYPT 2014. LNCS, vol. 8469, pp. 1\u201312. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06734-6_1"},{"issue":"12","key":"3_CR29","doi-asserted-by":"publisher","first-page":"7245","DOI":"10.1109\/TIT.2016.2616127","volume":"62","author":"P Gaborit","year":"2016","unstructured":"Gaborit, P., Z\u00e9mor, G.: On the hardness of the decoding and the minimum distance problems for rank codes. IEEE Trans. Inform. Theory 62(12), 7245\u20137252 (2016)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 267\u2013288. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054868"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from one-way functions. In: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, pp. 12\u201324 (1989)","DOI":"10.1145\/73007.73009"},{"key":"3_CR32","unstructured":"Legeay, M.: Permutation decoding: towards an approach using algebraic properties of the $$\\sigma $$-subcode. In: Augot, D., Canteaut, A. (eds.) WCC 2011, pp. 193\u2013202 (2011)"},{"issue":"2","key":"3_CR33","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s00145-007-9003-9","volume":"21","author":"R Overbeck","year":"2008","unstructured":"Overbeck, R.: Structural attacks for public key cryptosystems based on Gabidulin codes. J. Cryptol. 21(2), 280\u2013301 (2008)","journal-title":"J. Cryptol."},{"key":"3_CR34","unstructured":"Pham, B.D.: \u00c9tude et conception de nouvelles primitives de chiffrement fond\u00e9es sur les codes correcteurs d\u2019erreurs en m\u00e9trique rang. Ph.D. thesis, Rennes 1 (2021)"},{"key":"3_CR35","doi-asserted-by":"crossref","unstructured":"Renner, J., Jerkovits, T., Bartz, H.: Efficient decoding of interleaved low-rank parity-check codes. In: 2019 XVI International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY), pp. 121\u2013126. IEEE (2019)","DOI":"10.1109\/REDUNDANCY48165.2019.9003356"},{"key":"3_CR36","doi-asserted-by":"crossref","unstructured":"Renner, J., Puchinger, S., Wachter-Zeh, A.: Interleaving Loidreau\u2019s rank-metric cryptosystem. In: 2019 XVI International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY), pp. 127\u2013132. IEEE (2019)","DOI":"10.1109\/REDUNDANCY48165.2019.9003318"},{"key":"3_CR37","volume-title":"A Computational Introduction to Number Theory and Algebra","author":"V Shoup","year":"2009","unstructured":"Shoup, V.: A Computational Introduction to Number Theory and Algebra. Cambridge University Press, Cambridge (2009)"},{"key":"3_CR38","doi-asserted-by":"crossref","unstructured":"Wang, L.P.: Loong: a new IND-CCA-secure code-based KEM. In: 2019 IEEE International Symposium on Information Theory (ISIT), pp. 2584\u20132588. IEEE (2019)","DOI":"10.1109\/ISIT.2019.8849302"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-17234-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,25]],"date-time":"2022-09-25T21:02:58Z","timestamp":1664139778000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17234-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031172335","9783031172342"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17234-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PQCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Post-Quantum Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2022.pqcrypto.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}