Indifferentiability of confusion-diffusion networks
From MaRDI portal
Recommendations
Cited in
(24)- Indifferentiability for public key cryptosystems
- On a generalization of substitution-permutation networks: the HADES design strategy
- The \(t\)-wise independence of substitution-permutation networks
- KHAPE: Asymmetric PAKE from key-hiding key exchange
- Asymmetric PAKE with low computation \textit{and} communication
- Improved indifferentiability security proof for 3-round tweakable Luby-Rackoff
- Indifferentiability of 8-Round Feistel Networks
- On the indifferentiability of Fugue and Luffa
- Indifferentiability of the confusion-diffusion network and the cascade block cipher
- Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls
- Randomized half-ideal cipher on groups with applications to UC (a)PAKE
- Layout graphs, random walks and the t-wise independence of SPN block ciphers
- Sequential indifferentiability of confusion-diffusion networks
- Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules)
- On the sequential indifferentiability of the Lai-Massey construction
- The relationship between idealized models under computationally bounded adversaries
- Indifferentiability of 3-round confusion-diffusion networks
- Random oracle combiners: Merkle-Damgård style
- On the relationship between public key primitives via indifferentiability
- Sequential indifferentiability of 7-round Misty structures
- On the complexity of cryptographic groups and generic group models
- Attention is still what you need: another round of exploring Shoup's GGM
- Offline-online indifferentiability of cryptographic systems
- When simple permutations mix poorly. Limited independence does not imply pseudorandomness
This page was built for publication: Indifferentiability of confusion-diffusion networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5739219)