{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:27:57Z","timestamp":1778128077348,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":35,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819608935","type":"print"},{"value":"9789819608942","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-0894-2_3","type":"book-chapter","created":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:48:04Z","timestamp":1734050884000},"page":"68-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["MinRank Gabidulin Encryption Scheme on\u00a0Matrix Codes"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Aragon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Couvreur","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,12,13]]},"reference":[{"key":"3_CR1","unstructured":"Carlos Aguilar Melchor, Nicolas Aragon, Paulo Barreto, Slim Bettaieb, Lo\u00efc Bidoux, Olivier Blazy, Jean-Christophe Deneuville, Philippe Gaborit, Shay Gueron, Tim G\u00fcneysu, Rafael Misoczki, Edoardo Persichetti, Nicolas Sendrier, Jean-Pierre Tillich, and Gilles Z\u00e9mor. BIKE. First round submission to the NIST post-quantum cryptography call, November 2017."},{"key":"3_CR2","unstructured":"Carlos Aguilar Melchor, Nicolas Aragon, Slim Bettaieb, Lo\u00efc Bidoux, Olivier Blazy, Jean-Christophe Deneuville, Philippe Gaborit, and Gilles Z\u00e9mor. Rank quasi cyclic (RQC). First round submission to the NIST post-quantum cryptography call, November 2017."},{"key":"3_CR3","unstructured":"Carlos Aguilar Melchor, Nicolas Aragon, Slim Bettaieb, Lo\u00efc Bidoux, Olivier Blazy, Jean-Christophe Deneuville, Philippe Gaborit, Edoardo Persichetti, Gilles Z\u00e9mor, and Jurjen Bos. HQC. Round 3 Submission to the NIST Post-Quantum Cryptography Call, June 2021. https:\/\/pqc-hqc.org\/doc\/hqc-specification_2021-06-06.pdf."},{"key":"3_CR4","unstructured":"Martin Albrecht, Daniel\u00a0J. Bernstein, Tung Chou, Carlos Cid, Jan Gilcher, Tanja Lange, Varun Maram, Ingo von Maurich, Rafael Mizoczki, Ruben Niederhagen, Edoardo Persichetti, Kenneth Paterson, Christiane Peters, Peter Schwabe, Nicolas Sendrier, Jakub Szefer, Cen\u00a0Jung Tjhai, Martin Tomlinson, and Wang Wen. Classic McEliece (merger of Classic McEliece and NTS-KEM). https:\/\/classic.mceliece.org, November 2022. Fourth round finalist of the NIST post-quantum cryptography call."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Alekhnovich, Michael. More on Average Case vs Approximation Complexity. In 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pages 298\u2013307. IEEE Computer Society, 2003.","DOI":"10.1109\/SFCS.2003.1238204"},{"key":"3_CR6","unstructured":"Nicolas Aragon, Olivier Blazy, Jean-Christophe Deneuville, Philippe Gaborit, Adrien Hauteville, Olivier Ruatta, Jean-Pierre Tillich, Gilles Z\u00e9mor, Carlos Aguilar Melchor, Slim Bettaieb, Lo\u00efc Bidoux, Magali Bardet, and Ayoub Otmani. 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":"Nicolas Aragon, Pierre Briaud, Victor Dyseryn, Philippe Gaborit, and Adrien Vin\u00e7otte. The blockwise rank syndrome learning problem and its applications to cryptography. Cryptology ePrint Archive, Paper 2023\/1875, 2023.","DOI":"10.1007\/978-3-031-62743-9_3"},{"key":"3_CR8","unstructured":"Roberto Avanzi, Joppe Bos, L\u00e9o Ducas, Eike Kiltz, Tancr\u00e8de Lepoint, Vadim Lyubashevsky, John\u00a0M. Schanck, Peter Schwabe, Gregor Seiler, , and Damien Stehl\u00e9. Crystals-kyber. Third round submission to the NIST post-quantum cryptography call, August 2021."},{"key":"3_CR9","unstructured":"Magali Bardet, Pierre Briaud, Maxime Bros, Philippe Gaborit, and Jean-Pierre Tillich. Revisiting algebraic attacks on MinRank and on the rank decoding problem, 2022. ArXiv:2208.05471."},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Magali Bardet, Maxime Bros, Daniel Cabarcas, Philippe Gaborit, Ray Perlner, Daniel Smith-Tone, Jean-Pierre Tillich, and Javier Verbel. Improvements of algebraic attacks for solving the rank decoding and MinRank problems. In Advances in Cryptology - ASIACRYPT 2020, International Conference on the Theory and Application of Cryptology and Information Security, 2020. Proceedings, pages 507\u2013536, 2020.","DOI":"10.1007\/978-3-030-64837-4_17"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Hannes Bartz, Lukas Holzbaur, Hedongliang Liu, Sven Puchinger, Julian Renner, Antonia Wachter-Zeh, et\u00a0al. Rank-metric codes and their applications. Foundations and Trends\u00ae in Communications and Information Theory, 19(3):390\u2013546, 2022.","DOI":"10.1561\/0100000119"},{"key":"3_CR12","unstructured":"Daniel\u00a0J. Bernstein, Tung Chou, Tanja Lange, Ingo von Maurich, Rafael Mizoczki, Ruben Niederhagen, Edoardo Persichetti, Christiane Peters, Peter Schwabe, Nicolas Sendrier, Jakub Szefer, and Wang Wen. Classic McEliece: conservative code-based cryptography. https:\/\/classic.mceliece.org, November 2017. First round submission to the NIST post-quantum cryptography call."},{"key":"3_CR13","unstructured":"Lo\u00efc Bidoux, Pierre Briaud, Maxime Bros, and Philippe Gaborit. RQC revisited and more cryptanalysis for rank-based cryptography. ArXiv:2207.01410, 2022."},{"key":"3_CR14","unstructured":"Alain Couvreur, Thomas Debris-Alazard, and Philippe Gaborit. On the hardness of code equivalence problems in rank metric. working paper or preprint, November 2020."},{"key":"3_CR15","unstructured":"Alain Couvreur, Philippe Gaborit, Val\u00e9rie Gautier, Ayoub Otmani, and Jean-Pierre Tillich. Distinguisher-Based Attacks on Public-Key Cryptosystems Using Reed-Solomon Codes. In International Workshop on Coding and Cryptography - WCC 2013, pages 181\u2013193, Bergen, Norway, April 2013."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Philippe Delsarte. Bilinear forms over a finite field, with applications to coding theory. J. Comb. Theory, Ser. A, 25(3):226\u2013241, 1978.","DOI":"10.1016\/0097-3165(78)90015-8"},{"key":"3_CR17","unstructured":"Jean-Charles Faug\u00e8re, Val\u00e9rie Gauthier, Ayoub Otmani, Ludovic Perret, and Jean-Pierre Tillich. A distinguisher for high rate McEliece cryptosystems. IACR Cryptology ePrint Archive, Report2010\/331, 2010. http:\/\/eprint.iacr.org\/."},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Jean-Charles Faug\u00e8re, Mohab Safey El\u00a0Din, and Pierre-Jean Spaenlehauer. Computing loci of rank defects of linear matrices using Gr\u00f6bner bases and applications to cryptology. In International Symposium on Symbolic and Algebraic Computation, ISSAC 2010, Munich, Germany, July 25-28, 2010, pages 257\u2013264, 2010.","DOI":"10.1145\/1837934.1837984"},{"issue":"1","key":"3_CR19","first-page":"3","volume":"21","author":"Ernst M Gabidulin","year":"1985","unstructured":"Ernst\u00a0M. Gabidulin. Theory of codes with maximum rank distance. Problemy Peredachi Informatsii, 21(1):3\u201316, 1985.","journal-title":"Problemy Peredachi Informatsii"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/S1571-0653(04)00168-4","volume":"6","author":"Ernst M Gabidulin","year":"2001","unstructured":"Ernst\u00a0M. Gabidulin and Alexei\u00a0V. Ourivski. Modified GPT PKC with right scrambler. Electron. Notes Discrete Math., 6:168\u2013177, 2001.","journal-title":"Electron. Notes Discrete Math."},{"issue":"7","key":"3_CR21","doi-asserted-by":"publisher","first-page":"1391","DOI":"10.1007\/s10623-017-0402-0","volume":"86","author":"Philippe Gaborit","year":"2018","unstructured":"Philippe Gaborit, Ayoub Otmani, and Herv\u00e9 Tal\u00e9-Kalachi. Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes. Des. Codes Cryptogr., 86(7):1391\u20131403, 2018.","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"3_CR22","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF01390769","volume":"6","author":"Keith Gibson","year":"1995","unstructured":"Keith Gibson. Severely denting the Gabidulin version of the McEliece public key cryptosystem. Des. Codes Cryptogr., 6(1):37\u201345, 1995.","journal-title":"Des. Codes Cryptogr."},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Keith Gibson. The security of the Gabidulin public key cryptosystem. In Ueli Maurer, editor, Advances in Cryptology - EUROCRYPT \u201996, volume 1070 of LNCS, pages 212\u2013223. Springer, 1996.","DOI":"10.1007\/3-540-68339-9_19"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Sriram Gopalakrishnan, Vincent Neiger, and Mohab Safey\u00a0El Din. Refined $$f_5$$ algorithms for ideals of minors of square matrices, 2023.","DOI":"10.1145\/3597066.3597077"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Louis Goubin and Nicolas Courtois. Cryptanalysis of the TTM cryptosystem. In Tatsuaki Okamoto, editor, Advances in Cryptology - ASIACRYPT\u00a02000, volume 1976 of LNCS, pages 44\u201357. Springer, 2000.","DOI":"10.1007\/3-540-44448-3_4"},{"issue":"2","key":"3_CR26","first-page":"109","volume":"1","author":"Loo-Keng Hua","year":"1951","unstructured":"Loo-Keng Hua. A theorem on matrices over a field and its applications. J. Chinese Math. Soc., 1(2):109\u2013163, 1951.","journal-title":"J. Chinese Math. Soc."},{"key":"3_CR27","volume-title":"Rank metric and cryptography","author":"Pierre Loidreau","year":"2007","unstructured":"Pierre Loidreau. Rank metric and cryptography. Accreditation to supervise research, Universit\u00e9 Pierre et Marie Curie - Paris VI, January 2007."},{"key":"3_CR28","unstructured":"Robert\u00a0J. McEliece. A Public-Key System Based on Algebraic Coding Theory, pages 114\u2013116. Jet Propulsion Lab, 1978. DSN Progress Report 44."},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Rafael Misoczki, Jean-Pierre Tillich, Nicolas Sendrier, and Paulo S. L.\u00a0M. Barreto. MDPC-McEliece: New McEliece variants from moderate density parity-check codes, 2012.","DOI":"10.1109\/ISIT.2013.6620590"},{"issue":"2","key":"3_CR30","first-page":"159","volume":"15","author":"Harald Niederreiter","year":"1986","unstructured":"Harald Niederreiter. Knapsack-type cryptosystems and algebraic coding theory. Problems of Control and Information Theory, 15(2):159\u2013166, 1986.","journal-title":"Problems of Control and Information Theory"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Alexey Ourivskiy and Ernst Gabidulin. Column scrambler for the GPT cryptosystem. Discrete Applied Mathematics, 128:207\u2013221, 05 2003.","DOI":"10.1016\/S0166-218X(02)00446-8"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"Raphael Overbeck. A new structural attack for GPT and variants. In Mycrypt, volume 3715 of LNCS, pages 50\u201363, 2005.","DOI":"10.1007\/11554868_5"},{"issue":"2","key":"3_CR33","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s00145-007-9003-9","volume":"21","author":"Raphael Overbeck","year":"2008","unstructured":"Raphael Overbeck. Structural attacks for public key cryptosystems based on Gabidulin codes. J. Cryptology, 21(2):280\u2013301, 2008.","journal-title":"J. Cryptology"},{"key":"3_CR34","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10623-015-0077-3","volume":"80","author":"Alberto Ravagnani","year":"2016","unstructured":"Alberto Ravagnani. Rank-metric codes and their duality theory. Des. Codes Cryptogr., 80:197\u2013216, 2016.","journal-title":"Des. Codes Cryptogr."},{"key":"3_CR35","doi-asserted-by":"crossref","unstructured":"Christian Wieschebrink. Two NP-complete problems in coding theory with an application in code based cryptography. In Proc. IEEE Int. Symposium Inf. Theory - ISIT, pages 1733\u20131737, 2006.","DOI":"10.1109\/ISIT.2006.261651"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0894-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T01:02:15Z","timestamp":1734051735000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0894-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,13]]},"ISBN":["9789819608935","9789819608942"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0894-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,13]]},"assertion":[{"value":"13 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}