Out of Oddity - New Cryptanalytic Techniques Against Symmetric Primitives Optimized for Integrity Proof Systems
Tim Beyne, Anne Canteaut, Itai Dinur, Maria Eichlseder, Gregor Leander, Gaëtan Leurent, María Naya-Plasencia, Léo Perrin, Yu Sasaki, Yosuke Todo, Friedrich Wiemer
Abstract
The security and performance of many integrity proof systems like SNARKs, STARKs and Bulletproofs highly depend on the underlying hash function. For this reason several new proposals have recently been developed. These primitives obviously require an in-depth security evaluation, especially since their implementation constraints have led to less standard design approaches. This work compares the security levels offered by two recent families of such primitives, namely GMiMC and HadesMiMC. We exhibit low-complexity distinguishers against the GMiMC and HadesMiMC permutations for most parameters proposed in recently launched public challenges for STARK-friendly hash functions. In the more concrete setting of the sponge construction corresponding to the practical use in the ZK-STARK protocol, we present a practical collision attack on a round-reduced version of GMiMC and a preimage attack on some instances of HadesMiMC. To achieve those results, we adapt and generalize several cryptographic techniques to fields of odd characteristic.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext ee441a13-5eb5-4476-984b-b64be2ce2fb7Cited by top-tier papers6
- Poseidon: A New Hash Function for Zero-Knowledge Proof SystemsLorenzo Grassi, Dmitry Khovratovich, Christian Rechberger, Arnab Roy et al.USENIX Security 2021 · 410 citations
- New Design Techniques for Efficient Arithmetization-Oriented Hash Functions: ttAnemoi Permutations and ttJive Compression ModeClémence Bouvier, Pierre Briaud, Pyrros Chaidos, Léo Perrin et al.CRYPTO 2023 · 37 citations
- Reinforced Concrete: A Fast Hash Function for Verifiable ComputationLorenzo Grassi, Dmitry Khovratovich, Reinhard Lüftenegger, Christian Rechberger et al.CCS 2022 · 34 citations
- Coefficient Grouping for Complex Affine LayersFukang Liu, Lorenzo Grassi, Clémence Bouvier, Willi Meier et al.CRYPTO 2023 · 10 citations
- Generalized Feistel Ciphers for Efficient Prime Field MaskingLorenzo Grassi, Loïc Masure, Pierrick Méaux, Thorben Moos et al.EUROCRYPT 2024 · 4 citations
Builds on1
Related papers
- Generic MitM Attack Frameworks on Sponge ConstructionsXiaoyang Dong, Boxin Zhao, Lingyue Qin, Qingliang Hou et al.CRYPTO 2024 · 10 citations
- Recursion over Public-Coin Interactive Proof Systems; Faster Hash VerificationAlexandre Belling, Azam Soleimanian, Olivier BégassatCCS 2023 · 5 citations
- Permutation-Based Hashing with Stronger (Second) Preimage ResistanceSiwei Sun, Shun Li, Zhiyu Zhang, Charlotte Lefevre et al.CRYPTO 2026
- Tight Preimage Resistance of the Sponge ConstructionCharlotte Lefevre, Bart MenninkCRYPTO 2022 · 15 citations
- Time-Space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short CollisionsCody Freitag, Ashrujit Ghoshal, Ilan KomargodskiCRYPTO 2022 · 9 citations
