{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:44:14Z","timestamp":1767321854875,"version":"3.48.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032105356","type":"print"},{"value":"9783032105363","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-10536-3_19","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:39:40Z","timestamp":1767321580000},"page":"519-538","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Practical Attack on\u00a0All Parameters of\u00a0the\u00a0HPPC Signature Scheme"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0191-3181","authenticated-orcid":false,"given":"Pierre","family":"Briaud","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7838-2529","authenticated-orcid":false,"given":"Maxime","family":"Bros","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8793-2238","authenticated-orcid":false,"given":"Ray","family":"Perlner","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7995-8734","authenticated-orcid":false,"given":"Daniel","family":"Smith-Tone","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"19_CR1","volume-title":"Status report on the third round of the NIST post-quantum cryptography standardization process","author":"G Alagic","year":"2022","unstructured":"Alagic, G., et al.: Status report on the third round of the NIST post-quantum cryptography standardization process. Tech. rep, National Institute of Standards and Technology, Gaithersburg, MD (July (2022)"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Baena, J., Briaud, P., Cabarcas, D., Perlner, R., Smith-Tone, D., Verbel, J.: Improving support-minors rank attacks: applications to GeMSS and rainbow. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2022, pp. 376\u2013405. Springer (2022)","DOI":"10.1007\/978-3-031-15982-4_13"},{"key":"19_CR3","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 (2022)","DOI":"10.1007\/978-3-031-17234-2_6"},{"key":"19_CR4","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":"19_CR5","unstructured":"Bardet, M., Faug\u00e8re, J.C., Salvy, B., Yang, B.Y.: Asymptotic behaviour of the degree of regularity of semi-regular polynomial systems. https:\/\/api.semanticscholar.org\/CorpusID:10699714"},{"issue":"1","key":"19_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10623-012-9617-2","volume":"69","author":"L Bettale","year":"2013","unstructured":"Bettale, L., Faug\u00e8re, J.C., Perret, L.: Cryptanalysis of HFE, Multi-HFE and variants for odd and even characteristic. Des. Codes Crypt. 69(1), 1\u201352 (2013)","journal-title":"Des. Codes Crypt."},{"key":"19_CR7","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"},{"issue":"3","key":"19_CR8","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":"19_CR9","doi-asserted-by":"crossref","unstructured":"Cartor, R., Smith-Tone, D.: EFLASH: a new multivariate encryption scheme. In: Cid, C., Jr., M.J.J. (eds.) Selected Areas in Cryptography \u2013 SAC 2018, pp. 281\u2013299. Springer (2018)","DOI":"10.1007\/978-3-030-10970-7_13"},{"key":"19_CR10","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":"19_CR11","doi-asserted-by":"crossref","unstructured":"Ding, J., Perlner, R., Petzoldt, A., Smith-Tone, D.: Improved cryptanalysis of HFEv- via projection. In: Lange, T., Steinwandt, R. (eds.) Post-Quantum Cryptography, pp. 375\u2013395. Springer (2018)","DOI":"10.1007\/978-3-319-79063-3_18"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-642-17373-8_32","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"V Dubois","year":"2010","unstructured":"Dubois, V., Gama, N.: The degree of regularity of HFE systems. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 557\u2013576. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_32"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.C., Gianni, P.M., Lazard, D., Mora, T.: Efficient computation of zero-dimensional gr\u00f6bner bases by change of ordering 16(4), 329\u2013344 (1993)","DOI":"10.1006\/jsco.1993.1051"},{"issue":"1","key":"19_CR14","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), 61\u201388 (1999)","journal-title":"J. Pure Appl. Algebra"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Jiang, X., Ding, J., Hu, L.: Kipnis-shamir attack on HFE revisited. In: Pei, D., Yung, M., Lin, D., Wu, C. (eds.) Information Security and Cryptology, pp. 399\u2013411. Springer (2008)","DOI":"10.1007\/978-3-540-79499-8_31"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Joux, A., Faug\u00e8re, J.C.: Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using Grobner bases. In: Advances in Cryptology \u2013 CRYPTO 2003, pp. 44\u201360. Springer (2003)","DOI":"10.1007\/978-3-540-45146-4_3"},{"key":"19_CR17","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":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-319-89339-6_14","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2018","author":"G Macario-Rat","year":"2018","unstructured":"Macario-Rat, G., Patarin, J.: Two-face: new public key multivariate schemes. In: Joux, A., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 2018. LNCS, vol. 10831, pp. 252\u2013265. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89339-6_14"},{"key":"19_CR19","unstructured":"NIST Cryptographic Technology Group: Call for Additional Digital Signature Schemes for the Post-Quantum Cryptography Standardization Process. NIST Computer Security Resource Center (2022). https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/call-for-proposals-dig-sig-sept-2022.pdf"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-030-75245-3_7","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"M \u00d8ygarden","year":"2021","unstructured":"\u00d8ygarden, M., Felke, P., Raddum, H.: Analysis of multivariate encryption schemes: application to Dob. In: Garay, J.A. (ed.) PKC 2021. LNCS, vol. 12710, pp. 155\u2013183. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_7"},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-030-40186-3_5","volume-title":"Topics in Cryptology \u2013 CT-RSA 2020","author":"M \u00d8ygarden","year":"2020","unstructured":"\u00d8ygarden, M., Felke, P., Raddum, H., Cid, C.: Cryptanalysis of the multivariate encryption scheme EFLASH. In: Jarecki, S. (ed.) CT-RSA 2020. LNCS, vol. 12006, pp. 85\u2013105. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40186-3_5"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"\u00d8ygarden, M., Felke, P., Raddum, H.: Analysis of multivariate encryption schemes: application to Dob and C*. Journal of Cryptology 2024 (to appear). https:\/\/eprint.iacr.org\/2024\/595","DOI":"10.1007\/s00145-024-09501-w"},{"key":"19_CR23","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":"19_CR24","unstructured":"Rodriguez, B.G.: 3WISE: Cubic Element-Wise trapdoor based MPKC cryptosystem. NIST Round 1 submission to the Additional Call for Signature Schemes (2023). https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/round-1\/spec-files\/3wise-spec-web.pdf"},{"key":"19_CR25","unstructured":"Rodriguez, B.G.: HPPC: Hidden Product of Polynomial Composition. NIST Round 1 submission to the Additional Call for Signature Schemes (2023). https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/round-1\/spec-files\/hppc-spec-web.pdf"},{"key":"19_CR26","unstructured":"Rodriguez, B.G.: HPPC: Hidden Product of Polynomial Composition. Cryptology ePrint Archive, Paper 2023\/830 (2023). https:\/\/eprint.iacr.org\/2023\/830"},{"key":"19_CR27","unstructured":"Smith-Tone, D.: A Total Break of the 3WISE Digital Signature Scheme. Cryptology ePrint Archive, Paper 2023\/1535 (2023). https:\/\/eprint.iacr.org\/2023\/1535"},{"key":"19_CR28","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. LNCS, vol. 12825, pp. 70\u201393. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_4"},{"key":"19_CR29","unstructured":"Wang, L.C., et al.: SNOVA. NIST Round 1 submission to the Additional Call for Signature Schemes (2023). https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/round-1\/spec-files\/snova-spec-web.pdf"},{"key":"19_CR30","doi-asserted-by":"crossref","unstructured":"Wolf, C., Preneel, B.: Equivalent Keys in HFE, C*, and Variations. In: Dawson, E., Vaudenay, S. (eds.) Progress in Cryptology \u2013 Mycrypt 2005, pp. 33\u201349. Springer (2005)","DOI":"10.1007\/11554868_4"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography \u2013 SAC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-10536-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:39:42Z","timestamp":1767321582000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-10536-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032105356","9783032105363"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-10536-3_19","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":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Selected Areas in Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toronto, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sacworkshop.org\/SAC25\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}