Computational aspects of the expected differential probability of 4-round AES and AES-like ciphers
From MaRDI portal
Publication:2390943
DOI10.1007/s00607-009-0034-yzbMath1171.14017OpenAlexW2103526652WikidataQ22073990 ScholiaQ22073990MaRDI QIDQ2390943
Norbert Pramstaller, Vincent Rijmen, Mario Lamberger, Joan Daemen, Frederik Vercauteren
Publication date: 10 August 2009
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-009-0034-y
Related Items
Pholkos -- efficient large-state tweakable block ciphers from the AES round function ⋮ Mind the gap -- a closer look at the security of block ciphers against differential cryptanalysis ⋮ Pen and Paper Arguments for SIMON and SIMON-like Designs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Differential cryptanalysis of DES-like cryptosystems
- Understanding Two-Round Differentials in AES
- Provably Secure MACs from Differentially-Uniform Permutations and AES-Based Implementations
- On the Security of Rijndael-Like Structures against Differential and Linear Cryptanalysis
- On Almost Perfect Nonlinear Permutations
- Advanced Encryption Standard – AES
- The Design of a Stream Cipher LEX
- Fast Software Encryption
- Matrices over a Finite Field
- Fast Software Encryption