You are looking at a specific version 20091110:005308 of this paper. See the latest version.

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
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.