{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:27:58Z","timestamp":1778128078388,"version":"3.51.4"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031627422","type":"print"},{"value":"9783031627439","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-62743-9_3","type":"book-chapter","created":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T23:02:58Z","timestamp":1718060578000},"page":"75-106","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Blockwise Rank Syndrome Learning Problem and\u00a0Its Applications to\u00a0Cryptography"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Aragon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Briaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Dyseryn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Gaborit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrien","family":"Vin\u00e7otte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"3_CR1","unstructured":"Melchor, C.A., et al.: Rank quasi cyclic (RQC). Second Round submission to NIST Post-Quantum Cryptography call, April 2020"},{"key":"3_CR2","unstructured":"Melchor, C.A., et al.: HQC. Round 3 Submission to the NIST Post-Quantum Cryptography Call, June 2021. https:\/\/pqc-hqc.org\/"},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Aguilar-Melchor, C., Aragon, N., Dyseryn, V., Gaborit, P., Z\u00e9mor, G.: LRPC codes with multiple syndromes: near ideal-size KEMs without ideals. In: Cheon, J.H., Johansson, T. (eds.) International Conference on Post-Quantum Cryptography, vol. 13512, pp. 45\u201368. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-17234-2_3","DOI":"10.1007\/978-3-031-17234-2_3"},{"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, October 2020"},{"key":"3_CR5","unstructured":"Aragon, N., et al.: BIKE. NIST Round 1 submission for Post-Quantum Cryptography, November 2017"},{"key":"3_CR6","unstructured":"Aragon, N., et al.: ROLLO (merger of Rank-Ouroboros, LAKE and LOCKER). Second round submission to the NIST post-quantum cryptography call, March 2019"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Aragon, N., Dyseryn, V., Gaborit, P., Loidreau, P., Renner, J., Wachter-Zeh, A.: LowMS: a new rank metric code-based KEM without ideal structure. Cryptology ePrint Archive (2022)","DOI":"10.1007\/s10623-023-01330-5"},{"issue":"12","key":"3_CR8","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_CR9","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: 2018 IEEE International Symposium on Information Theory (ISIT), pp. 2421\u20132425. IEEE (2018)","DOI":"10.1109\/ISIT.2018.8437464"},{"key":"3_CR10","unstructured":"Avanzi, R., et al.: Crystals-Kyber. Third round submission to the NIST post-quantum cryptography call, August 2021"},{"key":"3_CR11","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_CR12","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_CR13","doi-asserted-by":"crossref","unstructured":"Bardet, M., Briaud, P., Bros, M., Gaborit, P., Tillich, J.-P.: Revisiting algebraic attacks on MinRank and on the rank decoding problem. Des. Codes Cryptogr. 91, 3671\u20133707 (2023)","DOI":"10.1007\/s10623-023-01265-x"},{"key":"3_CR14","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_CR15","doi-asserted-by":"crossref","unstructured":"Bettaieb, S., Bidoux, L., Connan, Y., Gaborit, P., Hauteville, A.: The learning with rank errors problem and an application to symmetric authentication. In: 2018 IEEE International Symposium on Information Theory (ISIT), pp. 2629\u20132633. IEEE (2018)","DOI":"10.1109\/ISIT.2018.8437529"},{"key":"3_CR16","unstructured":"Bidoux, L., Briaud, P., Bros, M., Gaborit, P.: RQC revisited and more cryptanalysis for rank-based cryptography. arXiv preprint arXiv:2207.01410 (2022)"},{"issue":"1","key":"3_CR17","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"},{"key":"3_CR18","doi-asserted-by":"publisher","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. (eds.) Advances in Cryptology-EUROCRYPT 1991: Workshop on the Theory and Application of Cryptographic Techniques Brighton, UK, 8\u201311 April 1991 Proceedings 10, pp. 482\u2013489. Springer, Cham (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_41","DOI":"10.1007\/3-540-46416-6_41"},{"key":"3_CR19","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_CR20","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_CR21","doi-asserted-by":"publisher","unstructured":"Gaborit, P., Ruatta, O., Schrek, J., Z\u00e9mor, G.: New results for rank-based cryptography. In: Pointcheval, D., Vergnaud, D. (eds.) Progress in Cryptology\u2013AFRICACRYPT 2014: 7th International Conference on Cryptology in Africa, Marrakesh, Morocco, 28\u201330 May 2014, Proceedings 7, pp. 1\u201312. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06734-6_1","DOI":"10.1007\/978-3-319-06734-6_1"},{"key":"3_CR22","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_CR23","doi-asserted-by":"publisher","unstructured":"Loidreau, P.: A new rank metric codes based encryption scheme. In: Lange, T., Takagi, T. (eds.) Post-Quantum Cryptography: 8th International Workshop, PQCrypto 2017, Utrecht, The Netherlands, 26\u201328 June 2017, Proceedings 8, pp. 3\u201317. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59879-6_1","DOI":"10.1007\/978-3-319-59879-6_1"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Misoczki, R., Tillich, J.-P., Sendrier, N., Barreto, P.S.L.M.: MDPC-McEliece: new McEliece variants from moderate density parity-check codes. In: 2013 IEEE International Symposium on Information Theory, pp. 2069\u20132073. IEEE (2013)","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1023\/A:1020369320078","volume":"38","author":"AV Ourivski","year":"2002","unstructured":"Ourivski, A.V., Johansson, T.: New technique for decoding codes in the rank metric and its cryptography applications. Probl. Inf. Transm. 38, 237\u2013246 (2002)","journal-title":"Probl. Inf. Transm."},{"key":"3_CR26","unstructured":"Philippe, G., Gilles, Z.: On the hardness of the decoding and the minimum distance problems for rank codes (2014)"},{"issue":"8","key":"3_CR27","doi-asserted-by":"publisher","first-page":"5075","DOI":"10.1109\/TIT.2022.3167629","volume":"68","author":"S Puchinger","year":"2022","unstructured":"Puchinger, S., Renner, J., Rosenkilde, J.: Generic decoding in the sum-rank metric. IEEE Trans. Inf. Theory 68(8), 5075\u20135097 (2022)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Song, Y., Zhang, J., Huang, X., Wu, W.: Blockwise rank decoding problem and LRPC codes: cryptosystems with smaller sizes. Cryptology ePrint Archive (2023)","DOI":"10.1007\/978-981-99-8739-9_10"}],"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-62743-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T23:03:30Z","timestamp":1718060610000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-62743-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031627422","9783031627439"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-62743-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"11 June 2024","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":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.maths.ox.ac.uk\/events\/conferences\/pqcrypto-2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}