\texttt{Horst} meets \textit{Fluid}-SPN: Griffin for zero-knowledge applications

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
On permutation polynomials over finite fields
\textsc{Ciminion}: symmetric encryption based on Toffoli-gates over large finite fields
Out of oddity -- new cryptanalytic techniques against symmetric primitives optimized for integrity proof systems
On a generalization of substitution-permutation networks: the HADES design strategy
Feistel structures for MPC, and more
Algebraic cryptanalysis of STARK-friendly designs: application to MARVELlous and MiMC
Aurora: transparent succinct arguments for R1CS
Scalable zero knowledge with no trusted setup
Reverse-Engineering the S-Box of Streebog, Kuznyechik and STRIBOBr1
Indifferentiability of 8-Round Feistel Networks
MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
Higher-Order Differential Properties of Keccak and Luffa
On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
The Rebound Attack: Cryptanalysis of Reduced Whirlpool and Grøstl
On Generalized Feistel Networks
The Random Oracle Model and the Ideal Cipher Model Are Equivalent
Rebound Attack on the Full Lane Compression Function
Rebound Distinguishers: Results on the Full Whirlpool Compression Function
How to Construct Pseudorandom Permutations from Pseudorandom Functions
The Wide Trail Design Strategy
The interpolation attack on block ciphers
About Feistel Schemes with Six (or More) Rounds
On the Indifferentiability of the Sponge Construction
Selected Areas in Cryptography
On the Size of Pairing-Based Non-interactive Arguments
Ligero: lightweight sublinear arguments without a trusted setup

This page was built for publication: \texttt{Horst} meets \textit{Fluid}-SPN: Griffin for zero-knowledge applications