Layout graphs, random walks and the \(t\)-wise independence of SPN block ciphers
From MaRDI portal
Publication:6145967
DOI10.1007/978-3-031-38548-3_23OpenAlexW4385654652MaRDI QIDQ6145967
Vinod Vaikuntanathan, Stefano Tessaro, Tianren Liu, Angelos Pelecanos
Publication date: 2 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38548-3_23
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- Differential cryptanalysis of DES-like cryptosystems
- A construction of a cipher from a single pseudorandom permutation.
- Provable security of (tweakable) block ciphers based on substitution-permutation networks
- Indifferentiability of iterated Even-Mansour ciphers with non-idealized key-schedules: five rounds are necessary and sufficient
- The \(t\)-wise independence of substitution-permutation networks
- Derandomized constructions of \(k\)-wise (almost) independent permutations
- Simple permutations mix well
- Optimally Secure Block Ciphers from Ideal Primitives
- Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
- Indifferentiability of 8-Round Feistel Networks
- On the Indifferentiability of Key-Alternating Ciphers
- Minimizing the Two-Round Even-Mansour Cipher
- Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations
- Security Analysis of Key-Alternating Feistel Ciphers
- Security of the AES with a Secret S-Box
- The Related-Key Security of Iterated Even–Mansour Ciphers
- On the Provable Security of the Iterated Even-Mansour Cipher Against Related-Key and Chosen-Key Attacks
- Biclique Cryptanalysis of the Full AES
- Simple permutations mix even better
- A Proof of Security in O(2 n ) for the Benes Scheme
- Indistinguishability Amplification
- Markov Ciphers and Differential Cryptanalysis
- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
- The interpolation attack on block ciphers
- Higher Order Derivatives and Differential Cryptanalysis
- An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher
- On the Indifferentiability of Key-Alternating Feistel Ciphers with No Key Derivation
- Tight Security Bounds for Key-Alternating Ciphers
- Proving the Security of AES Substitution-Permutation Network
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Indifferentiability of Confusion-Diffusion Networks
- Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs
This page was built for publication: Layout graphs, random walks and the \(t\)-wise independence of SPN block ciphers
