{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T04:23:23Z","timestamp":1775795003379,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031172335","type":"print"},{"value":"9783031172342","type":"electronic"}],"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_6","type":"book-chapter","created":{"date-parts":[[2022,9,25]],"date-time":"2022-09-25T21:02:18Z","timestamp":1664139738000},"page":"107-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Improvement of\u00a0Algebraic Attacks for\u00a0Solving Superdetermined MinRank Instances"],"prefix":"10.1007","author":[{"given":"Magali","family":"Bardet","sequence":"first","affiliation":[]},{"given":"Manon","family":"Bertin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,21]]},"reference":[{"key":"6_CR1","unstructured":"Aguilar Melchor, C., et al.: Rank quasi cyclic (RQC). Second Round submission to NIST Post-Quantum Cryptography call (2020). https:\/\/pqc-rqc.org"},{"key":"6_CR2","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":"6_CR3","unstructured":"Baena, J., Briaud, P., Cabarcas, D., Perlner, R.A., Smith-Tone, D., Verbel, J.A.: Improving support-minors rank attacks: applications to GeMSS and Rainbow. IACR Cryptol. ePrint Arch., Accepted for Publication in CRYPTO 2022, p. 1677 (2021). https:\/\/eprint.iacr.org\/2021\/1677"},{"key":"6_CR4","unstructured":"Banegas, G., et al.: DAGS: key encapsulation for dyadic GS codes (2017). https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/round-1\/submissions\/DAGS.zip. First round submission to the NIST post-quantum cryptography call"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-030-25922-8_5","volume-title":"Code-Based Cryptography","author":"M Bardet","year":"2019","unstructured":"Bardet, M., Bertin, M., Couvreur, A., Otmani, A.: Practical algebraic attack on DAGS. In: Baldi, M., Persichetti, E., Santini, P. (eds.) CBC 2019. LNCS, vol. 11666, pp. 86\u2013101. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25922-8_5"},{"key":"6_CR6","doi-asserted-by":"publisher","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, http:\/\/arxiv.org\/abs\/1910.00810","DOI":"10.1007\/978-3-030-45727-3_3"},{"key":"6_CR7","doi-asserted-by":"publisher","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, https:\/\/arxiv.org\/abs\/2002.08322v4","DOI":"10.1007\/978-3-030-64837-4_17"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-030-03326-2_4","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"\u00c9 Barelli","year":"2018","unstructured":"Barelli, \u00c9., Couvreur, A.: An efficient structural attack on NIST submission DAGS. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11272, pp. 93\u2013118. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03326-2_4"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-030-77870-5_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"W Beullens","year":"2021","unstructured":"Beullens, W.: Improved cryptanalysis of UOV and rainbow. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 348\u2013373. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_13"},{"key":"6_CR10","unstructured":"Beullens, W.: Breaking Rainbow takes a weekend on a laptop. IACR Cryptol. ePrint Arch. (2022). https:\/\/eprint.iacr.org\/2022\/214"},{"key":"6_CR11","series-title":"LNCS","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0080378","volume-title":"Determinantal Rings","author":"W Bruns","year":"1988","unstructured":"Bruns, W., Vetter, U.: Determinantal Rings. LNCS, vol. 1327. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/BFb0080378"},{"issue":"3","key":"6_CR12","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.: Computational complexity of some problems of linear algebra. J. Comput. System Sci. 58(3), 572\u2013596 (1999)","journal-title":"J. Comput. System Sci."},{"key":"6_CR13","unstructured":"Casanova, A., Faug\u00e8re, J., Macario-Rat, G., Patarin, J., Perret, L., Ryckeghem, J.: GeMSS: a great multivariate short signature. Second round submission to the NIST post-quantum cryptography call (2019). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/round-2-submissions\/GeMSS-Round2.zip"},{"key":"6_CR14","unstructured":"Ding, J., Chen, M.S., Petzoldt, A., Schmidt, D., Yang, B.Y.: Rainbow. Second round submission to the NIST post-quantum cryptography call (2019). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/round-2-submissions\/Rainbow-Round2.zip"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.C., Safey El Din, M., Spaenlehauer, P.J.: Gr\u00f6bner bases of bihomogeneous ideals generated by polynomials of bidegree (1,1): algorithms and complexity. J. Symb. Comput. 46(4), 406\u2013437 (2011)","DOI":"10.1016\/j.jsc.2010.10.014"},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Faug\u00e8re, J.C., Safey El Din, M., Spaenlehauer, P.J.: On the complexity of the generalized minrank problem. J. Symb. Comput. 55, 30\u201358 (2013). https:\/\/doi.org\/10.1016\/j.jsc.2013.03.004","DOI":"10.1016\/j.jsc.2013.03.004"},{"key":"6_CR17","doi-asserted-by":"publisher","unstructured":"Faug\u00e8re, J., Safey El Din, M., Spaenlehauer, P.: 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, 25\u201328 July 2010, pp. 257\u2013264 (2010). https:\/\/doi.org\/10.1145\/1837934.1837984","DOI":"10.1145\/1837934.1837984"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-48405-1_2","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"A Kipnis","year":"1999","unstructured":"Kipnis, A., Shamir, A.: Cryptanalysis of the HFE public key cryptosystem by relinearization. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 19\u201330. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_2"},{"key":"6_CR19","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes, 5th edn. North-Holland, Amsterdam (1986)"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-68339-9_4","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"J Patarin","year":"1996","unstructured":"Patarin, J.: Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 33\u201348. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_4"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-662-48797-6_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"A Petzoldt","year":"2015","unstructured":"Petzoldt, A., Chen, M.-S., Yang, B.-Y., Tao, C., Ding, J.: Design principles for HFEv- based multivariate signature schemes. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015, Part I. LNCS, vol. 9452, pp. 311\u2013334. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_14"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-319-11659-4_14","volume-title":"Post-Quantum Cryptography","author":"J Porras","year":"2014","unstructured":"Porras, J., Baena, J., Ding, J.: ZHFE, a new multivariate public key encryption scheme. In: Mosca, M. (ed.) PQCrypto 2014. LNCS, vol. 8772, pp. 229\u2013245. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11659-4_14"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-030-84242-0_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"C Tao","year":"2021","unstructured":"Tao, C., Petzoldt, A., Ding, J.: Efficient key recovery for all HFE signature variants. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part I. LNCS, vol. 12825, pp. 70\u201393. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_4"},{"key":"6_CR24","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":"J Verbel","year":"2019","unstructured":"Verbel, J., Baena, J., Cabarcas, D., Perlner, R., Smith-Tone, D.: On the complexity of \u201cSuperdetermined\u2019\u2019 minrank instances. In: Ding, J., Steinwandt, R. (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-17234-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,25]],"date-time":"2022-09-25T21:02:40Z","timestamp":1664139760000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17234-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031172335","9783031172342"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17234-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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)"}}]}}