New design techniques for efficient arithmetization-oriented hash functions: \texttt{Anemoi} permutations and \texttt{Jive} compression mode

DOI10.1007/978-3-031-38548-3_17MaRDI QIDQ6186770zbMATH OpenOpenAlexFDO

Authors Clémence Bouvier, Pierre Briaud, Pyrros Chaidos, Léo Perrin, Robin Salen, Vesselin Velichkov, Danny Willems

Publication date 2 February 2024

Published in Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-38548-3_17

zbMATH Keywords

\textsf{AIR}\textsf{Jive}\textsf{Plonk}\textsf{R1CS}\texttt{Anemoi}\texttt{Flystel}algebraic attacksarithmetic circuitsarithmetization-orientedCCZ-equivalencehash functionsMerkle treezero-knowledge

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cites work

• \textsc{Ciminion}: symmetric encryption based on Toffoli-gates over large finite fields
• A Generalisation of Dillon's APN Permutation With the Best Known Differential and Nonlinear Properties for All Fields of Size $2^{4k+2}$
• A new efficient algorithm for computing Gröbner bases (F₄)
• Codes, bent functions and permutations suitable for DES-like cryptosystems
• Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• From Farfalle to \textsc{Megafono} via Ciminion: the PRF \textsc{Hydra} for MPC applications
• scientific article; zbMATH DE number 638938 (Why is no real title available?)
• scientific article; zbMATH DE number 2151220 (Why is no real title available?)
• scientific article; zbMATH DE number 1394295 (Why is no real title available?)
• Keccak
• MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
• New classes of almost bent and almost perfect nonlinear polynomials
• On CCZ-equivalence, extended-affine equivalence, and function twisting
• On the size of pairing-based non-interactive arguments
• The Knowledge Complexity of Interactive Proof Systems

Cited in

(18)

• Security analysis of P-SPN schemes against invariant subspace attack with inactive S-boxes
• The algebraic FreeLunch: efficient Gröbner basis attacks against arithmetization-oriented primitives
• Exponential sums in linear cryptanalysis
• Link between the differential cryptanalysis and linear approximations over finite abelian groups and its applications
• Security analysis of the P-SPN structure with a class of linear layer matrix against invariant subspace attack
• Improved resultant attack against arithmetization-oriented primitives
• A degree bound for the c-boomerang uniformity of permutation monomials
• \textsf{Polocolo}: a ZK-friendly hash function based on S-boxes using power residues
• Gröbner basis cryptanalysis of Anemoi
• On generalizations of the Lai-Massey scheme
• A note on the Walsh spectrum of the \texttt{Flystel}
• A new security evaluation method based on resultant for arithmetic-oriented algorithms
• Modelling ciphers with overdefined systems of quadratic equations: application to Friday, Vision, RAIN and Biscuit
• Minimize the randomness in Rasta-like designs: how far can we go? Application to \textsc{Pasta}
• A univariate attack against the limited-data instance of Ciminion
• A Fiat-Shamir transformation from duplex sponges
• The XHash family for ZK-friendly hash functions
• A degree bound for the c-boomerang uniformity

This page was built for publication: New design techniques for efficient arithmetization-oriented hash functions: \texttt{Anemoi} permutations and \texttt{Jive} compression mode

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6186770)