{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T14:40:34Z","timestamp":1767969634523,"version":"3.49.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032019004","type":"print"},{"value":"9783032019011","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-032-01901-1_11","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T08:44:55Z","timestamp":1755333895000},"page":"335-367","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Improved Resultant Attack Against Arithmetization-Oriented Primitives"],"prefix":"10.1007","author":[{"given":"Augustin","family":"Bariant","sequence":"first","affiliation":[]},{"given":"Aur\u00e9lien","family":"Boeuf","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"Briaud","sequence":"additional","affiliation":[]},{"given":"Ma\u00ebl","family":"Hostettler","sequence":"additional","affiliation":[]},{"given":"Morten","family":"\u00d8ygarden","sequence":"additional","affiliation":[]},{"given":"H\u00e5vard","family":"Raddum","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Aly, A., Ashur, T., Ben-Sasson, E., Dhooghe, S., Szepieniec, A.: Design of symmetric-key primitives for advanced cryptographic protocols. IACR Trans. Symmetr. Cryptol. 1\u201345 (2020)","DOI":"10.46586\/tosc.v2020.i3.1-45"},{"key":"11_CR2","unstructured":"Ashur, T., Kindi, A., Mahzoun, M.: XHash8 and XHash12: efficient STARK-friendly hash functions. Cryptology ePrint Archive, Paper 2023\/1045 (2023)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Bariant, A., Boeuf, A., Briaud, P., Hostettler, M., \u00d8ygarden, M., Raddum, H.: Improved resultant attack against arithmetization-oriented primitives. Cryptology ePrint Archive, Paper 2025\/259 (2025)","DOI":"10.1007\/978-3-032-01901-1_11"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-031-68385-5_5","volume-title":"Advances in Cryptology - CRYPTO 2024","author":"A Bariant","year":"2024","unstructured":"Bariant, A., et al.: The algebraic FreeLunch: efficient Gr\u00f6bner basis attacks against arithmetization-oriented primitives. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCS, vol. 14923, pp. 139\u2013173. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68385-5_5"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Bariant, A., Bouvier, C., Leurent, G., Perrin, L.: Algebraic attacks against some arithmetization-oriented primitives. IACR Trans. Symmetr. Cryptol. 73\u2013101 (2022)","DOI":"10.46586\/tosc.v2022.i3.73-101"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Berthomieu, J., Neiger, V., El\u00a0Din, M.S., Faster change of order algorithm for Gr\u00f6bner bases under shape and stability assumptions. In: 2022 International Symposium on Symbolic and Algebraic Computation, Lille, France (2022)","DOI":"10.1145\/3476446.3535484"},{"key":"11_CR7","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Assche, G.: Sponge functions (2007)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-030-56877-1_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"T Beyne","year":"2020","unstructured":"Beyne, T.: Out of oddity \u2013 new cryptanalytic techniques against symmetric primitives optimized for integrity proof systems. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 299\u2013328. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_11"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-031-38548-3_17","volume-title":"Advances in Cryptology - CRYPTO 2023","author":"C Bouvier","year":"2023","unstructured":"Bouvier, C., et al.: New design techniques for efficient arithmetization-oriented hash functions: anemoi permutations and jive compression mode. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14083, pp. 507\u2013539. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38548-3_17"},{"issue":"7","key":"11_CR10","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/BF01178683","volume":"28","author":"DG Cantor","year":"1991","unstructured":"Cantor, D.G., Kaltofen, E.L.: On fast multiplication of polynomials over arbitrary algebras. Acta Informatica 28(7), 693\u2013701 (1991)","journal-title":"Acta Informatica"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Collins, G.E.: The calculation of multivariate polynomial resultants. In: Proceedings of the Second ACM Symposium on Symbolic and Algebraic Manipulation. SYMSAC \u201971, pp. 212\u2013222. Association for Computing Machinery, New York, NY, USA (1971)","DOI":"10.1145\/800204.806289"},{"key":"11_CR12","unstructured":"Cox, D.A., Little, J., O\u2019Shea, D.: Using Algebraic Geometry. Graduate Texts in Mathematics, 2nd edition. Springer, Cham (2005)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Cox, D.A., Little, J., O\u2019Shea, D.: Ideals, Varieties, and Algorithms. Springer, Cham (2015)","DOI":"10.1007\/978-3-319-16721-3"},{"issue":"1","key":"11_CR14","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"J-C 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":"11_CR15","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"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero (F$$_5$$). In: Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, pp. 75\u201383 (2002)","DOI":"10.1145\/780506.780516"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/978-3-031-38548-3_19","volume-title":"Advances in Cryptology - CRYPTO 2023","author":"L Grassi","year":"2023","unstructured":"Grassi, L., Hao, Y., Rechberger, C., Schofnegger, M., Walch, R., Wang, Q.: Horst meets fluid-SPN: griffin for zero-knowledge applications. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14083, pp. 573\u2013606. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38548-3_19"},{"key":"11_CR18","unstructured":"Grassi, L., Khovratovich, D., Rechberger, C., Roy, A., Schofnegger, M.: Poseidon: a new hash function for zero-knowledge proof systems. In: 30th USENIX Security Symposium (USENIX Security 21), pp. 519\u2013535 (2021)"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-031-37679-5_8","volume-title":"Progress in Cryptology - AFRICACRYPT 2023","author":"L Grassi","year":"2023","unstructured":"Grassi, L., Khovratovich, D., Schofnegger, M.: Poseidon2: a faster version of the poseidon hash function. In: El Mrabet, N., De Feo, L., Duquesne, S. (eds.) AFRICACRYPT 2023. LNCS, vol. 14064, pp. 177\u2013203. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-37679-5_8"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Li, X., Maza, M.M., Schost, \u00c9.: Fast arithmetic for triangular sets: From theory to practice. J. Symb. Comput. 44(7), 891\u2013907 (2009). International Symposium on Symbolic and Algebraic Computation","DOI":"10.1016\/j.jsc.2008.04.019"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Moenck, R.T.: Practical fast polynomial multiplication. In: Proceedings of the Third ACM Symposium on Symbolic and Algebraic Computation, SYMSAC \u201976, pp. 136\u2013148. Association for Computing Machinery, New York, NY, USA (1976)","DOI":"10.1145\/800205.806332"},{"key":"11_CR22","unstructured":"Roy, A., Steiner, M.J., Trevisani, S.: Arion: arithmetization-oriented permutation and hashing from generalized triangular dynamical systems. arXiv preprint arXiv:2303.04639 (2023)"},{"key":"11_CR23","unstructured":"Szepieniec, A., Ashur, T., Dhooghe, S.: Rescue-prime: a standard specification (SoK). Cryptology ePrint Archive (2020)"},{"key":"11_CR24","unstructured":"The PML team. PML: Polynomial Matrix Library. Version 0.3 (2023). https:\/\/github.com\/vneiger\/pml"},{"key":"11_CR25","unstructured":"Shoup, V., et al.: NTL: A Library for Doing Number Theory. https:\/\/libntl.org\/"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-981-96-0941-3_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2024","author":"H-S Yang","year":"2024","unstructured":"Yang, H.-S., Zheng, Q.-X., Yang, J., Liu, Q.-F., Tang, D.: A New Security Evaluation Method Based on Resultant for Arithmetic-Oriented Algorithms. In: Chung, K.M., Sasaki, Y. (eds.) ASIACRYPT 2024. LNCS, vol. 15490, pp. 457\u2013489. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-96-0941-3_15"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01901-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T14:57:35Z","timestamp":1757429855000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01901-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032019004","9783032019011"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01901-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","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":"Santa Barbara, CA","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}