{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T22:59:38Z","timestamp":1773269978539,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819562022","type":"print"},{"value":"9789819562039","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-981-95-6203-9_5","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:26:33Z","timestamp":1767320793000},"page":"85-106","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Programming Equation Systems of\u00a0Arithmetization-Oriented Primitives with\u00a0Constraints"],"prefix":"10.1007","author":[{"given":"Kexin","family":"Qiao","sequence":"first","affiliation":[]},{"given":"Mengyu","family":"Chang","sequence":"additional","affiliation":[]},{"given":"Junjie","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Changhai","family":"Ou","sequence":"additional","affiliation":[]},{"given":"An","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Liehuang","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Bariant, A., Boeuf, A., Briaud, P., Hostettler, M., \u00d8ygarden, M., Raddum, H.: Improved resultant attack against arithmetization-oriented primitives. In: Tauman Kalai, Y., Kamara, S.F. (eds.) Advances in Cryptology - CRYPTO 2025, pp. 335\u2013367. Springer, Cham (2025)","DOI":"10.1007\/978-3-032-01901-1_11"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Bariant, A., et al.: The algebraic FreeLunch: efficient Gr\u00f6bner basis attacks against arithmetization-oriented primitives. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology - CRYPTO 2024, pp. 139\u2013173. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-68385-5_5"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Bellini, E., et al.: CLAASP: a cryptographic library for the automated analysis of symmetric primitives. In: International Conference on Selected Areas in Cryptography, pp. 387\u2013408. Springer (2023)","DOI":"10.1007\/978-3-031-53368-6_19"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Bellini, E., Gerault, D., Grados, J., Makarim, R.H., Peyrin, T.: Fully automated differential-linear attacks against ARX ciphers. In: Rosulek, M. (ed.) Topics in Cryptology - CT-RSA 2023, pp. 252\u2013276. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-30872-7_10"},{"key":"5_CR5","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van\u00a0Assche, G.: Sponge functions. In: ECRYPT Hash Workshop, vol.\u00a02007 (2007)"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-540-78967-3_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"G Bertoni","year":"2008","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: On the indifferentiability of the sponge construction. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 181\u2013197. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_11"},{"key":"5_CR7","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van\u00a0Assche, G.: Keccak sponge function family main document. Submission to NIST (Round 2) 3(30), 320\u2013337 (2009)"},{"key":"5_CR8","doi-asserted-by":"crossref","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.) Advances in Cryptology - CRYPTO 2023, pp. 507\u2013539. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-38548-3_17"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Buchberger, B.: A theoretical basis for the reduction of polynomials to canonical forms. SIGSAM Bull. 10(3), 19\u201329 (1976)","DOI":"10.1145\/1088216.1088219"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-77886-6_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"C Dobraunig","year":"2021","unstructured":"Dobraunig, C., Grassi, L., Guinet, A., Kuijsters, D.: Ciminion: symmetric encryption based on toffoli-gates over large finite fields. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 3\u201334. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_1"},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"Faug\u00e8re, J., Gianni, P., Lazard, D., Mora, T.: Efficient computation of zero-dimensional Gr\u00f6bner bases by change of ordering. J. Symb. Comput. 16(4), 329\u2013344 (1993). https:\/\/doi.org\/10.1006\/jsco.1993.1051","DOI":"10.1006\/jsco.1993.1051"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Faug\u00e8re, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero (F5). In: Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, ISSAC 2002, pp. 75\u201383. Association for Computing Machinery, New York (2002). https:\/\/doi.org\/10.1145\/780506.780516","DOI":"10.1145\/780506.780516"},{"key":"5_CR13","doi-asserted-by":"crossref","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.) Advances in Cryptology \u2013 CRYPTO 2023, pp. 573\u2013606. Springer (2023)","DOI":"10.1007\/978-3-031-38548-3_19"},{"key":"5_CR14","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual (2024). https:\/\/www.gurobi.com"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"He, J., Hu, K., Preneel, B., Wang, M.: Stretching cube attacks: improved methods to recover massive superpolies. In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology - ASIACRYPT 2022, pp. 537\u2013566. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-22972-5_19"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Sun, L., Wang, W., Wang, M.: Accelerating the search of differential and linear characteristics with the SAT method. IACR Trans. Symmetric Cryptol. 269\u2013315 (2021)","DOI":"10.46586\/tosc.v2021.i1.269-315"},{"key":"5_CR17","unstructured":"Wu, W., Wang, B.: Research on new morphologic symmetric cryptographic algorithms. J. Cryptol. Res. 11(1), 128\u2013144 (2024). (in Chinese)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-6203-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T07:37:52Z","timestamp":1773214672000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-6203-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819562022","9789819562039"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-6203-9_5","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":"Inscrypt","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security and Cryptology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"19 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cisc22025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/inscrypt2025.xidian.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}