{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T17:12:05Z","timestamp":1775754725157,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032226945","type":"print"},{"value":"9783032226952","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-22695-2_5","type":"book-chapter","created":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T16:30:10Z","timestamp":1775752210000},"page":"130-155","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hybrid Subsupport Guessing: A New Hybrid Technique for\u00a0the\u00a0Rank Decoding Problem"],"prefix":"10.1007","author":[{"given":"Hugo","family":"Beeloo-Sauerbier Couv\u00e9e","sequence":"first","affiliation":[]},{"given":"Antonia","family":"Wachter-Zeh","sequence":"additional","affiliation":[]},{"given":"Violetta","family":"Weger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,10]]},"reference":[{"key":"5_CR1","unstructured":"Adj, G., et al.: MiRitH. In: First Round Submission to the Additional NIST Postquantum Cryptography Call (2023)"},{"key":"5_CR2","unstructured":"Melchor, C.A., et al.: ROLLO-Rank-Ouroboros, LAKE & LOCKER. NIST PQC Call for Proposals. Round 2 Submission (2020)"},{"key":"5_CR3","unstructured":"Melchor, C.A., et al.: Rank Quasi-Cyclic (RQC). NIST PQC Call for Proposals. Round 2 Submission (2020)"},{"key":"5_CR4","unstructured":"Aragon, N., et al.: RYDE Signature Scheme. In: Second Round Submission to the additional NIST Postquantum Cryptography Call (2025)"},{"key":"5_CR5","unstructured":"Aragon, N., et al.: RYDE. In: First Round Submission to the additional NIST Postquantum Cryptography Call (2023)"},{"key":"5_CR6","unstructured":"Aragon, N., et al.: MIRA. In: First Round Submission to the additional NIST Postquantum Cryptography Call (2023)"},{"issue":"4","key":"5_CR7","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1007\/s10623-023-01330-5","volume":"92","author":"N Aragon","year":"2024","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. Des. Codes Crypt. 92(4), 1075\u20131093 (2024)","journal-title":"Des. Codes Crypt."},{"key":"5_CR8","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 (2018)","DOI":"10.1109\/ISIT.2018.8437464"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Bardet, M., Bertin, M.: Improvement of algebraic attacks for solving superdetermined minrank instances. In: Cheon, J.H., Johansson, T. (eds.) Post-Quantum Cryptography, pp. 107\u2013123. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-17234-2_6"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Bardet, M., et al.: An algebraic attack on rank metric code-based cryptosystems. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 64\u201393. Springer (2020)","DOI":"10.1007\/978-3-030-45727-3_3"},{"issue":"11","key":"5_CR11","doi-asserted-by":"publisher","first-page":"3671","DOI":"10.1007\/s10623-023-01265-x","volume":"91","author":"M Bardet","year":"2023","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 Crypt. 91(11), 3671\u20133707 (2023)","journal-title":"Des. Codes Crypt."},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Bardet, M., et al.: Improvements of algebraic attacks for solving the rank decoding and MinRank problems. In: Moriai, S., Wang, H. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2020, pp. 507\u2013536. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-64837-4_17"},{"issue":"3","key":"5_CR13","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":"5_CR14","doi-asserted-by":"crossref","unstructured":"Byrne, E., Ravagnani, A.: Covering radius of matrix codes endowed with the rank metric (2016)","DOI":"10.1137\/16M1091769"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Chabaud, F., Stern, J.: The cryptographic security of the syndrome decoding problem for rank distance codes. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 368\u2013381. Springer (1996)","DOI":"10.1007\/BFb0034862"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"D\u2019Alconzo, G., Esser, A., Gangemi, A., Sanna, C.: Sneaking up the ranks: partial key exposure attacks on rank-based schemes. Cryptology ePrint Archive (2024)","DOI":"10.1007\/s10623-025-01738-1"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Esser, A., Verbel, J.A., Zweydinger, F., Bellini, E.: SoK: CryptographicEstimators - a Software Library for Cryptographic Hardness Estimation. In: AsiaCCS. ACM (2024)","DOI":"10.1145\/3634737.3645007"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Faugere, J.C., Levy-dit-Vehel, F., Perret, L.: Cryptanalysis of MinRank. In: Annual International Cryptology Conference, pp. 280\u2013296. Springer (2008)","DOI":"10.1007\/978-3-540-85174-5_16"},{"issue":"2","key":"5_CR19","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1109\/TIT.2015.2511786","volume":"62","author":"P Gaborit","year":"2015","unstructured":"Gaborit, P., Ruatta, O., Schrek, J.: On the complexity of the rank syndrome decoding problem. IEEE Trans. Inf. Theory 62(2), 1006\u20131019 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"5_CR20","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. Inf. Theory 62(12), 7245\u20137252 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"5_CR21","unstructured":"Levy-dit Vehel, F., Perret, L.: Algebraic decoding of rank metric codes. In: Proceedings of YACC, pp. 142\u2013152 (2006)"},{"key":"5_CR22","unstructured":"Loidreau, P.: Properties of codes in rank metric. arXiv preprint cs\/0610057 (2006)"},{"key":"5_CR23","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Technical report, DSN Progress report, Jet Propulsion Laboratory, Pasadena (1978)"},{"key":"5_CR24","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."},{"issue":"1","key":"5_CR25","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.ejc.2009.01.002","volume":"31","author":"K Wang","year":"2010","unstructured":"Wang, K., Guo, J., Li, F.: Association schemes based on attenuated spaces. Eur. J. Comb. 31(1), 297\u2013305 (2010)","journal-title":"Eur. J. Comb."}],"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-032-22695-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T16:30:13Z","timestamp":1775752213000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22695-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032226945","9783032226952"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22695-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"10 April 2026","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":"Saint-Malo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}