Paper 2012/069

Automatic Search of Attacks on round-reduced AES and Applications

Charles Bouillaguet, Patrick Derbez, and Pierre-Alain Fouque

Abstract

In this paper, we describe versatile and powerful algorithms for searching guess-and-determine and meet-in-the-middle attacks on some byte-oriented symmetric primitives. To demonstrate the strengh of these tools, we show that they allow to automatically discover new attacks on round-reduced AES with very low data complexity, and to find improved attacks on the AES-based MACs Alpha-MAC and Pelican-MAC, and also on the AES-based stream cipher LEX. Finally, the tools can be used in the context of fault attacks. These algorithms exploit the algebraically simple byte-oriented structure of the AES. When the attacks found by the tool are practical, they have been implemented and validated experimentally.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Published elsewhere. This is the full version
Contact author(s)
charles bouillaguet @ ens fr
History
2012-02-23: received
Short URL
https://ia.cr/2012/069
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2012/069,
      author = {Charles Bouillaguet and Patrick Derbez and Pierre-Alain Fouque},
      title = {Automatic Search of Attacks on round-reduced AES and Applications},
      howpublished = {Cryptology ePrint Archive, Paper 2012/069},
      year = {2012},
      note = {\url{https://eprint.iacr.org/2012/069}},
      url = {https://eprint.iacr.org/2012/069}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.