Automatic Search of Attacks on Round-Reduced AES and Applications

  • Charles Bouillaguet
  • Patrick Derbez
  • Pierre-Alain Fouque
Conference paper

DOI: 10.1007/978-3-642-22792-9_10

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6841)
Cite this paper as:
Bouillaguet C., Derbez P., Fouque PA. (2011) Automatic Search of Attacks on Round-Reduced AES and Applications. In: Rogaway P. (eds) Advances in Cryptology – CRYPTO 2011. CRYPTO 2011. Lecture Notes in Computer Science, vol 6841. Springer, Berlin, Heidelberg

Abstract

In this paper, we describe versatile and powerful algorithms for searching guess-and-determine and meet-in-the-middle attacks on byte-oriented symmetric primitives. To demonstrate the strengh of these tool, we show that they allows 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 attack found by the tool are practical, they have been implemented and validated.

Download to read the full conference paper text

Copyright information

© International Association for Cryptologic Research 2011

Authors and Affiliations

  • Charles Bouillaguet
    • 1
  • Patrick Derbez
    • 1
  • Pierre-Alain Fouque
    • 1
  1. 1.ENS, CNRS, INRIAParisFrance

Personalised recommendations