On a generalization of substitution-permutation networks: the HADES design strategy
From MaRDI portal
Publication:2119029
DOI10.1007/978-3-030-45724-2_23zbMath1492.94115OpenAlexW2977846258MaRDI QIDQ2119029
Reinhard Lüftenegger, Lorenzo Grassi, Christian Rechberger, Dragos Rotaru, Markus Schofnegger
Publication date: 23 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-45724-2_23
Related Items (17)
Effective and efficient masking with low noise using small-Mersenne-prime ciphers ⋮ From Farfalle to \textsc{Megafono} via Ciminion: the PRF \textsc{Hydra} for MPC applications ⋮ Coefficient grouping: breaking Chaghri and more ⋮ Cryptanalysis of Ciminion ⋮ Algebraic meet-in-the-middle attack on LowMC ⋮ On the field-based division property: applications to MiMC, Feistel MiMC and GMiMC ⋮ Cryptanalysis of symmetric primitives over rings and a key recovery attack on \textsf{Rubato} ⋮ Combined fault and leakage resilience: composability, constructions and compiler ⋮ Algebraic attacks on Rasta and Dasta using low-degree equations ⋮ Provable security of HADES structure ⋮ \textsc{Poseidon}2: a faster version of the \textsc{Poseidon} hash function ⋮ \texttt{Horst} meets \textit{Fluid}-SPN: Griffin for zero-knowledge applications ⋮ An algebraic attack on ciphers with low-degree round functions: application to full MiMC ⋮ \textsc{Ciminion}: symmetric encryption based on Toffoli-gates over large finite fields ⋮ Mind the middle layer: the HADES design strategy revisited ⋮ The inverse of \(\chi\) and its applications to Rasta-like ciphers ⋮ Out of oddity -- new cryptanalytic techniques against symmetric primitives optimized for integrity proof systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Differential cryptanalysis of DES-like cryptosystems
- Overdrive: making SPDZ great again
- Rasta: a cipher with low ANDdepth and few ANDs per bit
- Provable security of (tweakable) block ciphers based on substitution-permutation networks
- Feistel structures for MPC, and more
- Algebraic cryptanalysis of STARK-friendly designs: application to MARVELlous and MiMC
- Linear equivalence of block ciphers with partial non-linear layers: application to LowMC
- Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
- Optimized Interpolation Attacks on LowMC
- Higher-Order Cryptanalysis of LowMC
- Block Ciphers That Are Easier to Mask: How Far Can We Go?
- Cryptanalysis of SP Networks with Partial Non-Linear Layers
- Ciphers for MPC and FHE
- MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
- Biclique Cryptanalysis of the Full AES
- Hybrid approach for solving multivariate systems over finite fields
- Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
- The Wide Trail Design Strategy
- The cipher SHARK
- The interpolation attack on block ciphers
- The block cipher Square
- PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications
- Differential Cryptanalysis and Linear Distinguisher of Full-Round Zorro
- A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack
- Ideals, Varieties, and Algorithms
- A New Structural-Differential Property of 5-Round AES
- Indifferentiability of Confusion-Diffusion Networks
- Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs
- MARVELlous
This page was built for publication: On a generalization of substitution-permutation networks: the HADES design strategy
