Paper 2009/531
Super-Sbox Cryptanalysis: Improved Attacks for AES-like permutations
Henri Gilbert and Thomas Peyrin
Abstract
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 Grostl 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.
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- hash functioncryptanalysisAESGrostlECHO
- Contact author(s)
- thomas peyrin @ ingenico com
- History
- 2009-11-10: revised
- 2009-11-04: received
- See all versions
- Short URL
- https://ia.cr/2009/531
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2009/531,
author = {Henri Gilbert and Thomas Peyrin},
title = {Super-Sbox Cryptanalysis: Improved Attacks for AES-like permutations},
howpublished = {Cryptology ePrint Archive, Paper 2009/531},
year = {2009},
note = {\url{https://eprint.iacr.org/2009/531}},
url = {https://eprint.iacr.org/2009/531}
}
