{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T17:11:50Z","timestamp":1775754710295,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032226945","type":"print"},{"value":"9783032226952","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-22695-2_12","type":"book-chapter","created":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T16:29:50Z","timestamp":1775752190000},"page":"355-369","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multivariate Signatures with\u00a0Polynomial Factorization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-2549-1087","authenticated-orcid":false,"given":"Irene","family":"Di Muzio","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4584-3020","authenticated-orcid":false,"given":"Martin","family":"Feussner","sequence":"additional","affiliation":[]},{"given":"Igor","family":"Semaev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,10]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Alagic, G., et al.: Status report on the third round of the NIST post-quantum cryptography standardization process. Technical report IR 8413-upd1, NIST (2024)","DOI":"10.6028\/NIST.IR.8545"},{"issue":"5","key":"12_CR2","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.3934\/amc.2021047","volume":"17","author":"JB Baena","year":"2023","unstructured":"Baena, J.B., Cabarcas, D., Verbel, J.: On the complexity of solving generic overdetermined bilinear systems. Adv. Math. Commun. 17(5), 1210\u20131234 (2023)","journal-title":"Adv. Math. Commun."},{"key":"12_CR3","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","DOI":"10.1007\/978-3-030-64837-4_17"},{"key":"12_CR4","unstructured":"Bardet, M., Faug\u00e8re, J.C., Salvy, B.: Complexity of Gr\u00f6bner basis computation of semi-regular overdetermined sequences over $$\\mathbb{F}_{2}$$ with solutions in $$\\mathbb{F}_{2}$$. Technical report\u00a05049, INRIA (2003)"},{"key":"12_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. In: MEGA 2005 (2005)"},{"issue":"8","key":"12_CR6","doi-asserted-by":"publisher","first-page":"1853","DOI":"10.1002\/j.1538-7305.1967.tb03174.x","volume":"46","author":"ER Berlekamp","year":"1967","unstructured":"Berlekamp, E.R.: Factoring polynomials over finite fields. Bell Syst. Tech. J. 46(8), 1853\u20131859 (1967)","journal-title":"Bell Syst. Tech. J."},{"key":"12_CR7","doi-asserted-by":"publisher","unstructured":"Beullens, W.: Breaking rainbow takes a weekend on a laptop. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13508, pp. 464\u2013479. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_16","DOI":"10.1007\/978-3-031-15979-4_16"},{"key":"12_CR8","unstructured":"Beullens, W.: Personal communication (2025)"},{"key":"12_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/BFb0023480","volume-title":"STACS 1997","author":"JF Buss","year":"1997","unstructured":"Buss, J.F., Frandsen, G.S., Shallit, J.O.: The computational complexity of some problems of linear algebra. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol. 1200, pp. 451\u2013462. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0023480"},{"issue":"154","key":"12_CR10","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1090\/S0025-5718-1981-0606517-5","volume":"36","author":"DG Cantor","year":"1981","unstructured":"Cantor, D.G., Zassenhaus, H.: A new algorithm for factoring polynomials over finite fields. Math. Comput. 36(154), 587\u2013592 (1981)","journal-title":"Math. Comput."},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Cheng, C.M., Chou, T., Niederhagen, R., Yang, B.Y.: Solving quadratic equations with XL on parallel architectures. In: Prouff, E., Schaumont, P. (eds.) CHES 2012. LNCS, vol. 7428, pp. 356\u2013373. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33027-8_21","DOI":"10.1007\/978-3-642-33027-8_21"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1515\/crll.1960.203.47","volume":"203","author":"DE Daykin","year":"1960","unstructured":"Daykin, D.E.: Distribution of bordered persymmetric matrices in a finite field. Journal f\u00fcr die reine und angewandte Mathematik 203, 47\u201354 (1960)","journal-title":"Journal f\u00fcr die reine und angewandte Mathematik"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.C., Safey El\u00a0Din, 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":"12_CR14","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-85174-5_16","volume-title":"CRYPTO 2008","author":"JC Faug\u00e8re","year":"2008","unstructured":"Faug\u00e8re, J.C., Levy-dit Vehel, F., Perret, L.: Cryptanalysis of MinRank. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 280\u2013296. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_16"},{"key":"12_CR15","unstructured":"Feussner, M.: X24. https:\/\/github.com\/martinfeussner\/X24, gitHub repository. Accessed 29 Jan 2026"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Hodges, T.J., Iyer, H.R.: Semi-regularity of pairs of Boolean polynomials. Finite Fields Appl. 79 (2022)","DOI":"10.1016\/j.ffa.2022.101992"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1016\/j.jalgebra.2016.11.025","volume":"476","author":"TJ Hodges","year":"2017","unstructured":"Hodges, T.J., Molina, S.D., Schlather, J.: On the existence of homogeneous semi-regular sequences in $$\\mathbb{F} _2[X_1,\\dots, X_n]\/(X_1^2,\\dots, X_n^2)$$. J. Algebra 476, 519\u2013547 (2017)","journal-title":"J. Algebra"},{"key":"12_CR18","volume-title":"Hankel and Toeplitz Matrices and Forms: Algebraic Theory","author":"IS Iohvidov","year":"1982","unstructured":"Iohvidov, I.S.: Hankel and Toeplitz Matrices and Forms: Algebraic Theory. Springer, New York (1982)"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Johnson, C.R., \u0160migoc, H., Yang, D.: Solution theory for systems of bilinear equations (2013). arXiv:1303.4988","DOI":"10.1080\/03081087.2013.839670"},{"key":"12_CR20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-48405-1_2","volume-title":"CRYPTO 1999","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":"12_CR21","unstructured":"Kruglov, V.: Growth of the ideal generated by a quadratic multivariate function. Ph.D. thesis, University of Cincinnati (2010)"},{"key":"12_CR22","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/3-540-45961-8_39","volume-title":"Advances in Cryptology","author":"T Matsumoto","year":"1988","unstructured":"Matsumoto, T., Imai, H.: Public quadratic polynomial-tuples for efficient signature verification and message encryption. In: Barstow, D., et al. (eds.) Advances in Cryptology. LNCS, vol. 330, pp. 419\u2013453. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-45961-8_39"},{"key":"12_CR23","unstructured":"Moh, T.: On tame transformation method (TTM). In: Midwest Arithmetical Geometry in Cryptography Workshop. University of Illinois (1999)"},{"key":"12_CR24","unstructured":"National Institute of Standards and Technology: Call for Proposals. https:\/\/csrc.nist.gov\/projects\/pqc-dig-sig\/standardization\/call-for-proposals. Accessed 06 Nov 2025"},{"key":"12_CR25","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-68339-9_4","volume-title":"EUROCRYPT 1996","author":"J Patarin","year":"1996","unstructured":"Patarin, J.: Hidden field equations (HFE) and isomorphism 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":"12_CR26","unstructured":"Patarin, J.: The oil and vinegar signature scheme. In: Dagstuhl Workshop on Cryptography (1997)"},{"key":"12_CR27","unstructured":"PQShield: NIST Signature Zoo. https:\/\/pqshield.github.io\/nist-sigs-zoo\/. Accessed 06 Nov 2025"},{"key":"12_CR28","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.jalgebra.2020.08.035","volume":"565","author":"I Semaev","year":"2021","unstructured":"Semaev, I., Tenti, A.: Probabilistic analysis on Macaulay matrices over finite fields and complexity of constructing Gr\u00f6bner bases. J. Algebra 565, 651\u2013674 (2021)","journal-title":"J. Algebra"},{"key":"12_CR29","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-642-38616-9_16","volume-title":"PQCrypto 2013","author":"C Tao","year":"2013","unstructured":"Tao, C., Diene, A., Tang, S., Ding, J.: Simple matrix scheme for encryption. In: Gaborit, P. (ed.) PQCrypto 2013. LNCS, vol. 7932, pp. 231\u2013242. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38616-9_16"},{"key":"12_CR30","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-030-84242-0_4","volume-title":"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"}],"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-032-22695-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T16:29:52Z","timestamp":1775752192000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22695-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032226945","9783032226952"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22695-2_12","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":"10 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"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":"Saint-Malo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}