Pairwise Independence of AES-Like Block Ciphers
Tim Beyne, Gregor Leander, Immo Schütt
2026Year
1Citations
Abstract
We prove that rounds of an AES variant with independent and uniform random round keys are -close to pairwise independent with . This result follows from a near-optimal bound for a two-norm version of pairwise independence for the Shark construction, depending on the third singular value of the difference-distribution table of the S-boxes. Our analysis combines insights from cryptanalysis — in particular, truncated differentials — and linear algebra over the reals.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Related papers
- New Techniques for Analyzing Differentials with Application to AESItai DinurEUROCRYPT 2026
- The t-wise Independence of Substitution-Permutation NetworksTianren Liu, Stefano Tessaro, Vinod VaikuntanathanCRYPTO 2021 · 17 citations
- Layout Graphs, Random Walks and the t-Wise Independence of SPN Block CiphersTianren Liu, Angelos Pelecanos, Stefano Tessaro, Vinod VaikuntanathanCRYPTO 2023 · 9 citations
- How Fast Does the Inverse Walk Approximate a Random Permutation?Vishesh Jain, Tianren Liu, Clayton Mizgerd, Angelos Pelecanos et al.CRYPTO 2026 · 1 citation
- Differential Meet-In-The-Middle CryptanalysisChristina Boura, Nicolas David, Patrick Derbez, Gregor Leander et al.CRYPTO 2023 · 24 citations
