\texttt{Horst} meets \textit{Fluid}-SPN: Griffin for zero-knowledge applications
From MaRDI portal
Publication:6186772
Recommendations
- Out of oddity -- new cryptanalytic techniques against symmetric primitives optimized for integrity proof systems
- Feistel structures for MPC, and more
- MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
- Security of the Poseidon hash function against non-binary differential and linear attacks
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
Cites work
- \textsc{Ciminion}: symmetric encryption based on Toffoli-gates over large finite fields
- About Feistel schemes with six (or more) rounds
- Algebraic cryptanalysis of STARK-friendly designs: application to MARVELlous and MiMC
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- Aurora: transparent succinct arguments for R1CS
- Feistel structures for MPC, and more
- Higher-order differential properties of Keccak and Luffa
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- scientific article; zbMATH DE number 177050 (Why is no real title available?)
- scientific article; zbMATH DE number 503238 (Why is no real title available?)
- scientific article; zbMATH DE number 1024070 (Why is no real title available?)
- scientific article; zbMATH DE number 1942429 (Why is no real title available?)
- scientific article; zbMATH DE number 1951617 (Why is no real title available?)
- scientific article; zbMATH DE number 2009979 (Why is no real title available?)
- scientific article; zbMATH DE number 2081068 (Why is no real title available?)
- scientific article; zbMATH DE number 1759317 (Why is no real title available?)
- scientific article; zbMATH DE number 1394292 (Why is no real title available?)
- scientific article; zbMATH DE number 967945 (Why is no real title available?)
- Indifferentiability of 8-Round Feistel Networks
- Ligero: lightweight sublinear arguments without a trusted setup
- MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
- On a generalization of substitution-permutation networks: the HADES design strategy
- On generalized Feistel networks
- On permutation polynomials over finite fields
- On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
- On the Indifferentiability of the Sponge Construction
- On the size of pairing-based non-interactive arguments
- Out of oddity -- new cryptanalytic techniques against symmetric primitives optimized for integrity proof systems
- Rebound attack on the full Lane compression function
- Rebound distinguishers: results on the full Whirlpool compression function
- Reverse-engineering the S-Bbox of Streebog, Kuznyechik and Stribobr1
- Scalable zero knowledge with no trusted setup
- Selected Areas in Cryptography
- The interpolation attack on block ciphers
- The Random Oracle Model and the Ideal Cipher Model Are Equivalent
- The Rebound Attack: Cryptanalysis of Reduced Whirlpool and Grøstl
- The Wide Trail Design Strategy
Cited in
(12)- 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
- 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
- On generalizations of the Lai-Massey scheme
- A new security evaluation method based on resultant for arithmetic-oriented algorithms
- 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
- Generalized triangular dynamical system: an algebraic system for constructing cryptographic permutations over finite fields
- The XHash family for ZK-friendly hash functions
This page was built for publication: \texttt{Horst} meets \textit{Fluid}-SPN: Griffin for zero-knowledge applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6186772)
