Skip to Main content Skip to Navigation
Conference papers

Improved Key Recovery Attacks on Reduced-Round AES in the Single-Key Setting

Patrick Derbez 1 Pierre-Alain Fouque 2, 3 Jérémy Jean 4
1 CASCADE - Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities
DI-ENS - Département d'informatique de l'École normale supérieure, Inria Paris-Rocquencourt, CNRS - Centre National de la Recherche Scientifique : UMR 8548
Abstract : In this paper, we revisit meet-in-the-middle attacks on AES in the single-key model and improve on Dunkelman, Keller and Shamir attacks at Asiacrypt 2010. We present the best attack on 7 rounds of AES-128 where data/time/memory complexities are below 2 100 . Moreover, we are able to extend the number of rounds to reach attacks on 8 rounds for both AES-192 and AES-256. This gives the best attacks on those two versions with a data complexity of 2 107 chosen-plaintexts, a memory complexity of 2 96 and a time complexity of 2 172 for AES-192 and 2 196 for AES-256. Finally, we also describe the best attack on 9 rounds of AES-256 with 2 120 chosen plaintexts and time and memory complexities of 2 203 . All these attacks have been found by carefully studying the number of reachable multisets in Dunkelman et al. attacks.
Document type :
Conference papers
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download
Contributor : Pierre-Alain Fouque <>
Submitted on : Friday, December 12, 2014 - 9:36:46 AM
Last modification on : Tuesday, May 4, 2021 - 2:06:02 PM
Long-term archiving on: : Saturday, April 15, 2017 - 8:15:10 AM


Files produced by the author(s)



Patrick Derbez, Pierre-Alain Fouque, Jérémy Jean. Improved Key Recovery Attacks on Reduced-Round AES in the Single-Key Setting. Advances in Cryptology - 2013, May 2013, Athenes, Greece. pp.17, ⟨10.1007/978-3-642-38348-9_23⟩. ⟨hal-01094304⟩



Record views


Files downloads