Sciweavers

FSE
2010
Springer

Super-Sbox Cryptanalysis: Improved Attacks for AES-Like Permutations

14 years 4 months ago
Super-Sbox Cryptanalysis: Improved Attacks for AES-Like Permutations
In this paper, we improve the recent rebound and start-from-the-middle attacks on AES-like permutations. Our new cryptanalysis technique uses the fact that one can view two rounds of such permutations as a layer of big Sboxes preceded and followed by simple affine transformations. The big Sboxes encountered in this alternative representation are named Super-Sboxes. We apply this method to two second-round SHA-3 candidates Grøstl and ECHO, and obtain improvements over the previous cryptanalysis results for these two schemes. Moreover, we improve the best distinguisher for the AES block cipher in the known-key setting, reaching 8 rounds for the 128-bit version. Key words: hash function, cryptanalysis, AES, Grøstl and ECHO.
Henri Gilbert, Thomas Peyrin
Added 19 Jul 2010
Updated 19 Jul 2010
Type Conference
Year 2010
Where FSE
Authors Henri Gilbert, Thomas Peyrin
Comments (0)