{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T18:04:44Z","timestamp":1767981884323,"version":"3.49.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031400025","type":"print"},{"value":"9783031400032","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-40003-2_2","type":"book-chapter","created":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T13:03:04Z","timestamp":1691586184000},"page":"38-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Cryptanalysis of\u00a0Rank-Metric Schemes Based on\u00a0Distorted Gabidulin Codes"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Briaud","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Loidreau","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,10]]},"reference":[{"key":"2_CR1","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, Paper 2022\/1596 (2022). https:\/\/eprint.iacr.org\/2022\/1596"},{"key":"2_CR2","doi-asserted-by":"publisher","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 2018), Vail, CO, USA, 17\u201322 June 2018, pp. 2421\u20132425. IEEE (2018). https:\/\/doi.org\/10.1109\/ISIT.2018.8437464","DOI":"10.1109\/ISIT.2018.8437464"},{"key":"2_CR3","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":"Magali Bardet","year":"2021","unstructured":"Bardet, Magali, Briaud, Pierre: An algebraic approach to the rank support learning problem. In: Cheon, Jung Hee, Tillich, Jean-Pierre. (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":"2_CR4","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, Anne, Ishai, Yuval (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 64\u201393. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_3"},{"key":"2_CR5","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. Cryptology ePrint Archive, Paper 2022\/1031 (2022). https:\/\/eprint.iacr.org\/2022\/1031","DOI":"10.1007\/s10623-023-01265-x"},{"key":"2_CR6","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, Shiho, Wang, Huaxiong (eds.) ASIACRYPT 2020. LNCS, vol. 12491, pp. 507\u2013536. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_17"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/BFb0034862","volume-title":"Advances in Cryptology \u2014 ASIACRYPT \u201996","author":"F Chabaud","year":"1996","unstructured":"Chabaud, F., Stern, J.: The cryptographic security of the syndrome decoding problem for rank distance codes. In: Kim, K., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol. 1163, pp. 368\u2013381. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0034862"},{"issue":"9","key":"2_CR8","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1007\/s10623-020-00781-4","volume":"88","author":"D Coggia","year":"2020","unstructured":"Coggia, D., Couvreur, A.: On the security of a Loidreau rank metric code based encryption scheme. Des. Codes Crypt. 88(9), 1941\u20131957 (2020). https:\/\/doi.org\/10.1007\/s10623-020-00781-4","journal-title":"Des. Codes Crypt."},{"key":"2_CR9","first-page":"333","volume":"62","author":"D Coppersmith","year":"1994","unstructured":"Coppersmith, D.: Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm. Math. Comput. 62, 333\u2013350 (1994)","journal-title":"Math. Comput."},{"issue":"3","key":"2_CR10","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/0097-3165(78)90015-8","volume":"25","author":"P Delsarte","year":"1978","unstructured":"Delsarte, P.: Bilinear forms over a finite field, with applications to coding theory. J. Comb. Theory Ser. A 25(3), 226\u2013241 (1978)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"1\u20133","key":"2_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"JC Faug\u00e8re","year":"1999","unstructured":"Faug\u00e8re, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases (F4). J. Pure Appl. Algebra 139(1\u20133), 61\u201388 (1999)","journal-title":"J. Pure Appl. Algebra"},{"key":"2_CR12","unstructured":"Faug\u00e8re, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero: F5. In: Proceedings ISSAC 2002, pp. 75\u201383. ACM Press (2002)"},{"issue":"4","key":"2_CR13","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/j.jsc.2010.10.014","volume":"46","author":"JC Faug\u00e8re","year":"2011","unstructured":"Faug\u00e8re, J.C., Safey El Din, M., Spacodecrenlehauer, P.J.: Gr\u00f6bner bases of bihomogeneous ideals generated by polynomials of bidegree (1,1): algorithms and complexity. J. Symbolic Comput. 46(4), 406\u2013437 (2011)","journal-title":"J. Symbolic Comput."},{"issue":"1","key":"2_CR14","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":"2_CR15","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":"E. M. 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, Donald W.. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 482\u2013489. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_41"},{"key":"2_CR16","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":"Philippe Gaborit","year":"2017","unstructured":"Gaborit, Philippe, Hauteville, Adrien, Phan, Duong Hieu, Tillich, Jean-Pierre.: Identity-based encryption from codes with rank metric. In: Katz, Jonathan, Shacham, Hovav (eds.) CRYPTO 2017. LNCS, vol. 10403, pp. 194\u2013224. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_7"},{"issue":"2","key":"2_CR17","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1109\/TIT.2015.2511786","volume":"62","author":"P Gaborit","year":"2016","unstructured":"Gaborit, P., Ruatta, O., Schrek, J.: On the complexity of the rank syndrome decoding problem. IEEE Trans. Inf. Theory 62(2), 1006\u20131019 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2_CR18","unstructured":"Levy-dit-Vehel, F., Perret, L.: Algebraic decoding of rank metric codes. Talk at the Special Semester on Gr\u00f6bner Bases - Workshop D1, pp. 1\u201319 (2006). https:\/\/ricamwww.ricam.oeaw.ac.at\/specsem\/srs\/groeb\/download\/Levy.pdf"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-59879-6_1","volume-title":"Post-Quantum Cryptography","author":"Pierre Loidreau","year":"2017","unstructured":"Loidreau, Pierre: A new rank metric codes based encryption scheme. In: Lange, Tanja, Takagi, Tsuyoshi (eds.) PQCrypto 2017. LNCS, vol. 10346, pp. 3\u201317. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59879-6_1"},{"key":"2_CR20","unstructured":"McEliece, R.J.: A Public-Key System Based on Algebraic Coding Theory, pp. 114\u2013116. Jet Propulsion Lab (1978). dSN Progress Report 44"},{"issue":"3","key":"2_CR21","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(3), 237\u2013246 (2002). https:\/\/doi.org\/10.1023\/A:1020369320078","journal-title":"Probl. Inf. Transm."},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/11554868_5","volume-title":"Progress in Cryptology \u2013 Mycrypt 2005","author":"R Overbeck","year":"2005","unstructured":"Overbeck, R.: A new structural attack for GPT and variants. In: Dawson, E., Vaudenay, S. (eds.) Mycrypt 2005. LNCS, vol. 3715, pp. 50\u201363. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11554868_5"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-030-25510-7_10","volume-title":"Post-Quantum Cryptography","author":"Javier Verbel","year":"2019","unstructured":"Verbel, Javier, Baena, John, Cabarcas, Daniel, Perlner, Ray, Smith-Tone, Daniel: On the complexity of \u201csuperdetermined\u2019\u2019 minrank instances. In: Ding, Jintai, Steinwandt, Rainer (eds.) PQCrypto 2019. LNCS, vol. 11505, pp. 167\u2013186. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25510-7_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-40003-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T13:03:15Z","timestamp":1691586195000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-40003-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031400025","9783031400032"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-40003-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"10 August 2023","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":"College Park, MD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pqcrypto2023.umiacs.io\/","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":"51","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":"25","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":"49% - 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.16","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":"3.30","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)"}}]}}