Revisiting iterated attacks in the context of decorrelation theory
From MaRDI portal
Publication:458736
DOI10.1007/s12095-014-0101-xzbMath1298.94081OpenAlexW2073411533MaRDI QIDQ458736
Aslı Bay, Serge Vaudenay, Atefeh Mashatan
Publication date: 8 October 2014
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: http://infoscience.epfl.ch/record/203420
block ciphersboomerang distinguishersdecorrelation theorydifferential-linear distinguishersiterated attacks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Almost \(k\)-wise independence versus \(k\)-wise independence
- New hash functions and their use in authentication and set equality
- Universal classes of hash functions
- Decorrelation: a theory for block cipher security
- Resistance against Adaptive Plaintext-Ciphertext Iterated Distinguishers
- Resistance against Iterated Attacks by Decorrelation Revisited
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Perfect nonlinear S-boxes
- Probability Inequalities for Sums of Bounded Random Variables
- Proving the Security of AES Substitution-Permutation Network
- Dial C for Cipher
- KFC – The Krazy Feistel Cipher