{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T19:39:51Z","timestamp":1780774791430,"version":"3.54.1"},"publisher-location":"Cham","reference-count":61,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031385476","type":"print"},{"value":"9783031385483","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-38548-3_19","type":"book-chapter","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T19:02:27Z","timestamp":1691521347000},"page":"573-606","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Horst Meets Fluid-SPN: Griffin for\u00a0Zero-Knowledge Applications"],"prefix":"10.1007","author":[{"given":"Lorenzo","family":"Grassi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yonglin","family":"Hao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"Rechberger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Markus","family":"Schofnegger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roman","family":"Walch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qingju","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,8,9]]},"reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-030-34618-8_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"MR Albrecht","year":"2019","unstructured":"Albrecht, M.R., et al.: Algebraic cryptanalysis of\u00a0STARK-friendly designs: application to MARVELlous and MiMC. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11923, pp. 371\u2013397. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_13"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-030-29962-0_8","volume-title":"Computer Security \u2013 ESORICS 2019","author":"MR Albrecht","year":"2019","unstructured":"Albrecht, M.R., et al.: Feistel structures for MPC, and more. In: Sako, K., Schneider, S., Ryan, P.Y.A. (eds.) ESORICS 2019. LNCS, vol. 11736, pp. 151\u2013171. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29962-0_8"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-662-53887-6_7","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"M Albrecht","year":"2016","unstructured":"Albrecht, M., Grassi, L., Rechberger, C., Roy, A., Tiessen, T.: MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 191\u2013219. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_7"},{"key":"19_CR4","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. Symmetric Cryptol. 2020(3), 1\u201345 (2020)","DOI":"10.46586\/tosc.v2020.i3.1-45"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: lightweight sublinear arguments without a trusted setup. In: CCS, pp. 2087\u20132104. ACM (2017)","DOI":"10.1145\/3133956.3134104"},{"key":"19_CR6","unstructured":"Bardet, M., Faug\u00e9re, J.C., Salvy, B., Yang, B.Y.: Asymptotic behaviour of the degree of regularity of semi-regular polynomial systems. In: Proceedings of MEGA, vol. 5 (2005)"},{"key":"19_CR7","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable, transparent, and post-quantum secure computational integrity. Cryptology ePrint Archive, Report 2018\/46 (2018)"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-030-17653-2_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"E Ben-Sasson","year":"2019","unstructured":"Ben-Sasson, E., Chiesa, A., Riabzev, M., Spooner, N., Virza, M., Ward, N.P.: Aurora: transparent succinct arguments for R1CS. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 103\u2013128. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_4"},{"key":"19_CR9","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":"19_CR10","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., et al.: 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":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-38424-3_1","volume-title":"Advances in Cryptology-CRYPT0\u2019 90","author":"E Biham","year":"1991","unstructured":"Biham, E., Shamir, A.: Differential cryptanalysis of DES-like cryptosystems. In: Menezes, A.J., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 2\u201321. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-38424-3_1"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-662-49890-3_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"A Biryukov","year":"2016","unstructured":"Biryukov, A., Perrin, L., Udovenko, A.: Reverse-engineering the S-Box of Streebog, Kuznyechik and STRIBOBr1. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 372\u2013402. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_15"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/3-540-45708-9_21","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"J Black","year":"2002","unstructured":"Black, J., Rogaway, P., Shrimpton, T.: Black-box analysis of the block-cipher-based hash-function constructions from PGV. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 320\u2013335. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_21"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-642-21702-9_15","volume-title":"Fast Software Encryption","author":"C Boura","year":"2011","unstructured":"Boura, C., Canteaut, A., De Canni\u00e8re, C.: Higher-order differential properties of Keccak and Luffa. In: Joux, A. (ed.) FSE 2011. LNCS, vol. 6733, pp. 252\u2013269. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21702-9_15"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Bouvier, C., et al.: New design techniques for efficient arithmetization-oriented hash functions: Anemoi Permutations and Jive Compression Mode. IACR Cryptology ePrint Archive, p. 840 (2022)","DOI":"10.1007\/978-3-031-38548-3_17"},{"key":"19_CR16","unstructured":"Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. Ph.D. thesis, University of Innsbruck (1965)"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: short proofs for confidential transactions and more. In: IEEE Symposium on Security and Privacy, pp. 315\u2013334. IEEE Computer Society (2018)","DOI":"10.1109\/SP.2018.00020"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-85174-5_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"J-S Coron","year":"2008","unstructured":"Coron, J.-S., Patarin, J., Seurin, Y.: The random oracle model and the ideal cipher model are equivalent. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 1\u201320. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_1"},{"key":"19_CR19","doi-asserted-by":"publisher","unstructured":"Cox, D.A., Little, J., O\u2019Shea, D.: Ideals, Varieties, and Algorithms - An Introduction to Computational Algebraic Geometry and Commutative Algebra, 2nd edn. Undergraduate Texts in Mathematics. Springer, Cham (1997). https:\/\/doi.org\/10.1007\/978-3-319-16721-3","DOI":"10.1007\/978-3-319-16721-3"},{"key":"19_CR20","unstructured":"de la Cruz Jim\u00e9nez, R.A.: On some methods for constructing almost optimal s-boxes and their resilience against side-channel attacks. IACR Cryptology ePrint Archive, p. 618 (2018)"},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-45325-3_20","volume-title":"Cryptography and Coding","author":"J Daemen","year":"2001","unstructured":"Daemen, J., Rijmen, V.: The wide trail design strategy. In: Honary, B. (ed.) Cryptography and Coding 2001. LNCS, vol. 2260, pp. 222\u2013238. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45325-3_20"},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-662-53018-4_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"Y Dai","year":"2016","unstructured":"Dai, Y., Steinberger, J.: Indifferentiability of 8-round Feistel networks. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 95\u2013120. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_4"},{"key":"19_CR23","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":"19_CR24","doi-asserted-by":"crossref","unstructured":"Dolmatov, V., Degtyarev, A.: GOST R 34.11-2012: Hash function. RFC 6986, pp. 1\u201340 (2013)","DOI":"10.17487\/rfc6986"},{"issue":"2","key":"19_CR25","doi-asserted-by":"publisher","first-page":"48","DOI":"10.46586\/tosc.v2018.i2.48-78","volume":"2018","author":"S Duval","year":"2018","unstructured":"Duval, S., Leurent, G.: MDS matrices with lightweight circuits. IACR Trans. Symmetric Cryptol. 2018(2), 48\u201378 (2018)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"19_CR26","unstructured":"Federal Agency on Technical Regulation and Metrology: GOST R 34.12-2015: Block cipher (2015)"},{"key":"19_CR27","unstructured":"Gabizon, A., Williamson, Z.J.: plookup: a simplified polynomial protocol for lookup tables. IACR Cryptology ePrint Archive, p. 315 (2020)"},{"key":"19_CR28","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotaru, O.: PLONK: permutations over Lagrange-bases for Oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive, Report 2019\/953 (2019)"},{"key":"19_CR29","unstructured":"Grassi, L.: On Generalizations of the Lai-Massey scheme: the blooming of amaryllises. IACR Cryptology ePrint Archive, p. 1245 (2022)"},{"key":"19_CR30","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. IACR Cryptology ePrint Archive, p. 403 (2022)","DOI":"10.1007\/978-3-031-38548-3_19"},{"key":"19_CR31","doi-asserted-by":"crossref","unstructured":"Grassi, L., Khovratovich, D., L\u00fcftenegger, R., Rechberger, C., Schofnegger, M., Walch, R.: Reinforced concrete: fast hash function for zero knowledge proofs and verifiable computation. Cryptology ePrint Archive, Report 2021\/1038 (2021). Accepted at ACM CCS 2022","DOI":"10.1145\/3548606.3560686"},{"key":"19_CR32","unstructured":"Grassi, L., Khovratovich, D., Rechberger, C., Roy, A., Schofnegger, M.: Poseidon: a new hash function for zero-knowledge proof systems. In: USENIX Security Symposium, pp. 519\u2013535. USENIX Association (2021)"},{"issue":"1","key":"19_CR33","doi-asserted-by":"publisher","first-page":"5","DOI":"10.46586\/tosc.v2022.i1.5-37","volume":"2022","author":"L Grassi","year":"2022","unstructured":"Grassi, L., Khovratovich, D., R\u00f8njom, S., Schofnegger, M.: The Legendre symbol and the Modulo-2 operator in symmetric schemes over Fnp preimage attack on full Grendel. IACR Trans. Symmetric Cryptol. 2022(1), 5\u201337 (2022)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"19_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/978-3-030-45724-2_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"L Grassi","year":"2020","unstructured":"Grassi, L., L\u00fcftenegger, R., Rechberger, C., Rotaru, D., Schofnegger, M.: On a generalization of substitution-permutation networks: the HADES design strategy. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 674\u2013704. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_23"},{"issue":"3","key":"19_CR35","doi-asserted-by":"publisher","first-page":"20","DOI":"10.46586\/tosc.v2022.i3.20-72","volume":"2022","author":"L Grassi","year":"2022","unstructured":"Grassi, L., Onofri, S., Pedicini, M., Sozzi, L.: Invertible quadratic non-linear layers for MPC-\/FHE-\/ZK-friendly schemes over Fnp: application to Poseidon. IACR Trans. Symmetric Cryptol. 2022(3), 20\u201372 (2022)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"19_CR36","doi-asserted-by":"crossref","unstructured":"Grassi, L., Rechberger, C., Rotaru, D., Scholl, P., Smart, N.P.: MPC-friendly symmetric key primitives. In: CCS, pp. 430\u2013443. ACM (2016)","DOI":"10.1145\/2976749.2978332"},{"key":"19_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-662-49896-5_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"J Groth","year":"2016","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 305\u2013326. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_11"},{"key":"19_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-3-642-14623-7_33","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"VT Hoang","year":"2010","unstructured":"Hoang, V.T., Rogaway, P.: On generalized Feistel networks. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 613\u2013630. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_33"},{"key":"19_CR39","unstructured":"Hougaard, H.B.: 3-round Feistel is not superpseudorandom over any group. IACR Cryptology ePrint Archive, p. 675 (2021)"},{"key":"19_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/BFb0052332","volume-title":"Fast Software Encryption","author":"T Jakobsen","year":"1997","unstructured":"Jakobsen, T., Knudsen, L.R.: The interpolation attack on block ciphers. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 28\u201340. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052332"},{"key":"19_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-540-24654-1_18","volume-title":"Selected Areas in Cryptography","author":"A Klimov","year":"2004","unstructured":"Klimov, A., Shamir, A.: Cryptographic applications of T-functions. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol. 3006, pp. 248\u2013261. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24654-1_18"},{"issue":"2","key":"19_CR42","first-page":"1","volume":"2016","author":"S K\u00f6lbl","year":"2016","unstructured":"K\u00f6lbl, S., Lauridsen, M.M., Mendel, F., Rechberger, C.: Haraka V2 - efficient short-input hashing for post-quantum applications. IACR Trans. Symmetric Cryptol. 2016(2), 1\u201329 (2016)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"19_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/3-540-46877-3_35","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201990","author":"X Lai","year":"1991","unstructured":"Lai, X., Massey, J.L.: A proposal for a new block encryption standard. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol. 473, pp. 389\u2013404. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46877-3_35"},{"key":"19_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-10366-7_8","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"M Lamberger","year":"2009","unstructured":"Lamberger, M., Mendel, F., Rechberger, C., Rijmen, V., Schl\u00e4ffer, M.: Rebound distinguishers: results on the full whirlpool compression function. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 126\u2013143. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_8"},{"issue":"2","key":"19_CR45","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M Luby","year":"1988","unstructured":"Luby, M., Rackoff, C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Comput. 17(2), 373\u2013386 (1988)","journal-title":"SIAM J. Comput."},{"key":"19_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/3-540-48285-7_33","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201993","author":"M Matsui","year":"1994","unstructured":"Matsui, M.: Linear cryptanalysis method for DES cipher. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 386\u2013397. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48285-7_33"},{"key":"19_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-642-10366-7_7","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"K Matusiewicz","year":"2009","unstructured":"Matusiewicz, K., Naya-Plasencia, M., Nikoli\u0107, I., Sasaki, Yu., Schl\u00e4ffer, M.: Rebound attack on the full Lane compression function. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 106\u2013125. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_7"},{"key":"19_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/3-540-39200-9_34","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"U Maurer","year":"2003","unstructured":"Maurer, U., Pietrzak, K.: The security of many-round Luby-Rackoff pseudo-random permutations. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 544\u2013561. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_34"},{"key":"19_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-03317-9_16","volume-title":"Fast Software Encryption","author":"F Mendel","year":"2009","unstructured":"Mendel, F., Rechberger, C., Schl\u00e4ffer, M., Thomsen, S.S.: The Rebound attack: cryptanalysis of reduced whirlpool and Grostl. In: Dunkelman, O. (ed.) FSE 2009. LNCS, vol. 5665, pp. 260\u2013276. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03317-9_16"},{"key":"19_CR50","doi-asserted-by":"crossref","unstructured":"Mollin, R.A., Small, C.: On permutation polynomials over finite fields. Int. J. Math. Math. Sci. 10, 535\u2013543 (1987)","DOI":"10.1155\/S0161171287000644"},{"key":"19_CR51","unstructured":"National Institute of Standards and Technology: SHA-3 Standard: Permutation-based hash and extendable-output functions. Federal Information Processing Standards Publication (FIPS) (2015)"},{"key":"19_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BFb0034838","volume-title":"Advances in Cryptology \u2014 ASIACRYPT \u201996","author":"K Nyberg","year":"1996","unstructured":"Nyberg, K.: Generalized Feistel networks. In: Kim, K., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol. 1163, pp. 91\u2013104. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0034838"},{"key":"19_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-69710-1_8","volume-title":"Fast Software Encryption","author":"J Patarin","year":"1998","unstructured":"Patarin, J.: About Feistel schemes with six (or more) rounds. In: Vaudenay, S. (ed.) FSE 1998. LNCS, vol. 1372, pp. 103\u2013121. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-69710-1_8"},{"key":"19_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-45682-1_14","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"J Patarin","year":"2001","unstructured":"Patarin, J.: Generic attacks on Feistel schemes. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 222\u2013238. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_14"},{"key":"19_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/3-540-36492-7_18","volume-title":"Selected Areas in Cryptography","author":"S Patel","year":"2003","unstructured":"Patel, S., Ramzan, Z., Sundaram, G.S.: Luby-Racko. ciphers: why XOR is not so exclusive. In: Nyberg, K., Heys, H. (eds.) SAC 2002. LNCS, vol. 2595, pp. 271\u2013290. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36492-7_18"},{"key":"19_CR56","unstructured":"Polygon: Introducing Plonky2 (2022). https:\/\/blog.polygon.technology\/introducing-plonky2\/"},{"key":"19_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/3-540-48329-2_31","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 93","author":"B Preneel","year":"1994","unstructured":"Preneel, B., Govaerts, R., Vandewalle, J.: Hash functions based on block ciphers: a synthetic approach. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 368\u2013378. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_31"},{"key":"19_CR58","unstructured":"Szepieniec, A.: On the use of the Legendre symbol in symmetric cipher design. IACR Cryptology ePrint Archive, p. 984 (2021)"},{"key":"19_CR59","unstructured":"Szepieniec, A., Ashur, T., Dhooghe, S.: Rescue-prime: a standard specification (SoK). Cryptology ePrint Archive, Report 2020\/1143 (2020)"},{"key":"19_CR60","unstructured":"Zcash: ZCash protocol specification (2021). https:\/\/github.com\/zcash\/zips\/blob\/master\/protocol\/protocol.pdf"},{"key":"19_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/0-387-34805-0_42","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"Y Zheng","year":"1990","unstructured":"Zheng, Y., Matsumoto, T., Imai, H.: On the construction of block ciphers provably secure and not relying on any unproved hypotheses. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 461\u2013480. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_42"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38548-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T22:02:47Z","timestamp":1753567367000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38548-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031385476","9783031385483"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38548-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 August 2023","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2023\/","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":"479","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":"124","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":"26% - 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":"15","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)"}}]}}