Automatic search of attacks on round-reduced AES and applications

59Citations
Citations of this article
65Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2011 International Association for Cryptologic Research.

Cite

CITATION STYLE

APA

Bouillaguet, C., Derbez, P., & Fouque, P. A. (2011). Automatic search of attacks on round-reduced AES and applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6841 LNCS, pp. 169–187). Springer Verlag. https://doi.org/10.1007/978-3-642-22792-9_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free