{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T16:18:07Z","timestamp":1781367487091,"version":"3.54.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030842413","type":"print"},{"value":"9783030842420","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-84242-0_4","type":"book-chapter","created":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T23:06:57Z","timestamp":1628636817000},"page":"70-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":34,"title":["Efficient Key Recovery for All HFE Signature Variants"],"prefix":"10.1007","author":[{"given":"Chengdong","family":"Tao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Albrecht","family":"Petzoldt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jintai","family":"Ding","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,8,11]]},"reference":[{"key":"4_CR1","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":"4_CR2","unstructured":"Beullens, W.: Improved Attacks on UOV and Rainbow. IACR eprint 2020\/1343 (2020)"},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10623-012-9617-2","volume":"69","author":"L Bettale","year":"2013","unstructured":"Bettale, L., Faugere, J.C., Perret, L.: Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic. Des. Codes Crypt. 69(1), 1\u201352 (2013). https:\/\/doi.org\/10.1007\/s10623-012-9617-2","journal-title":"Des. Codes Crypt."},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Bernstein, D., Buchmann, J., Dahmen, E. (eds.): Post Quantum Cryptography. Springer, Berlin (2009). https:\/\/doi.org\/10.1007\/978-3-540-88702-7_1","DOI":"10.1007\/978-3-540-88702-7_1"},{"issue":"3","key":"4_CR5","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":"4_CR6","unstructured":"Campagna, M., Chen, K., Dagdelen, \u00d6., Ding, J., Ferrick, J.K., Gisin, N., et al.: Quantum safe cryptography and security. ETSI White paper 8. https:\/\/www.etsi.org\/images\/files\/ETSIWhitePapers\/QuantumSafeWhitepaper.pdf (2015)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-319-29360-8_11","volume-title":"Post-Quantum Cryptography","author":"R Cartor","year":"2016","unstructured":"Cartor, R., Gipson, R., Smith-Tone, D., Vates, J.: On the differential security of the HFEv- signature primitive. In: Takagi, T. (ed.) PQCrypto 2016. LNCS, vol. 9606, pp. 162\u2013181. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29360-8_11"},{"key":"4_CR8","unstructured":"Casanova, A., Faugere, J.C., Macario Rat, G., Patarin, J., Perret, L., Ryckegem, J.: GeMSS: a great multivariate short signature (2019). Submission to NIST PQC competition Round-3"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/3-540-36288-6_25","volume-title":"Public Key Cryptography \u2014 PKC 2003","author":"NT Courtois","year":"2003","unstructured":"Courtois, N.T., Daum, M., Felke, P.: On the security of HFE, HFEv- and quartz. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 337\u2013350. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36288-6_25"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Ding, J., Clough, C., Araujo, R.: Inverting square systems algebraically is exponential. Finite Fields Appl. 26, 32\u201346 (2014)","DOI":"10.1016\/j.ffa.2013.10.004"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1007\/978-3-642-22792-9_41","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"J Ding","year":"2011","unstructured":"Ding, J., Hodges, T.J.: Inverting HFE systems is quasi-polynomial for all fields. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 724\u2013742. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_41"},{"key":"4_CR12","unstructured":"Ding, J., Kleinjung, T.: Degree of regularity for HFE Minus (HFE-). J. Math Ind. 4, 97\u2013104 (2012)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-319-79063-3_18","volume-title":"Post-Quantum Cryptography","author":"J Ding","year":"2018","unstructured":"Ding, J., Perlner, R., Petzoldt, A., Smith-Tone, D.: Improved cryptanalysis of HFEv- via projection. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 375\u2013395. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_18"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Ding, J., Petzoldt, A.: Current state of multivariate cryptography. IEEE Secur. Priv. 15(4), 28\u201336 (2017)","DOI":"10.1109\/MSP.2017.3151328"},{"key":"4_CR15","series-title":"Advances in Information Security","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-0716-0987-3","volume-title":"Multivariate Public Key Cryptosystems","author":"J Ding","year":"2020","unstructured":"Ding, J., Petzoldt, A., Schmidt, D.S.: Multivariate Public Key Cryptosystems. AIS, vol. 80. Springer, New York (2020). https:\/\/doi.org\/10.1007\/978-1-0716-0987-3. ISBN 978-1-0716-0985-9"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-642-38616-9_4","volume-title":"Post-Quantum Cryptography","author":"J Ding","year":"2013","unstructured":"Ding, J., Yang, B.-Y.: Degree of regularity for HFEv and HFEv-. In: Gaborit, P. (ed.) PQCrypto 2013. LNCS, vol. 7932, pp. 52\u201366. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38616-9_4"},{"key":"4_CR17","doi-asserted-by":"crossref","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)","DOI":"10.1016\/S0022-4049(99)00005-5"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.C., El Din, M.S., Spaenlehauer, P.J.: Computing loci of rank defects of linear matrices using Gr\u00f6bner bases and applications to cryptology. In: Proceedings of the International Symposium on Symbolic and Algebraic Computation, pp. 257\u2013264 (2010)","DOI":"10.1145\/1837934.1837984"},{"issue":"2","key":"4_CR19","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. Theor. 62(2), 1006\u20131019 (2016)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"4_CR20","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-44448-3_4","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2000","author":"L Goubin","year":"2000","unstructured":"Goubin, L., Courtois, N.T.: Cryptanalysis of the TTM cryptosystem. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 44\u201357. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44448-3_4"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-540-79499-8_31","volume-title":"Information Security and Cryptology","author":"X Jiang","year":"2008","unstructured":"Jiang, X., Ding, J., Hu, L.: Kipnis-shamir attack on HFE revisited. In: Pei, D., Yung, M., Lin, D., Wu, C. (eds.) Inscrypt 2007. LNCS, vol. 4990, pp. 399\u2013411. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79499-8_31"},{"key":"4_CR23","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":"4_CR24","unstructured":"Macario-Rat, G., Patarin, J.: Ariadne Thread and Salt: New Multivariate Cryptographic Schemes with Public Keys in Degree 3. https:\/\/eprint.iacr.org\/2021\/084.pdf"},{"key":"4_CR25","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":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/3-540-45353-9_21","volume-title":"Topics in Cryptology \u2014 CT-RSA 2001","author":"J Patarin","year":"2001","unstructured":"Patarin, J., Courtois, N., Goubin, L.: QUARTZ, 128-bit long digital signatures. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 282\u2013297. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45353-9_21"},{"key":"4_CR27","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. LNCS, vol. 9452, pp. 311\u2013334. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_14"},{"issue":"4","key":"4_CR28","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1515\/jmc.2011.004","volume":"4","author":"C Wolf","year":"2011","unstructured":"Wolf, C., Preneel, B.: Equivalent keys in multivariate quadratic public key systems. J. Math. Cryptology 4(4), 375\u2013415 (2011)","journal-title":"J. Math. Cryptology"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-84242-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T00:03:24Z","timestamp":1723334604000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-84242-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030842413","9783030842420"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-84242-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"426","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":"103","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":"24% - 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","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":"20.9","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)"}},{"value":"1 invited paper is also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}