Faster Chosen-Key Distinguishers on Reduced-Round AES - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Faster Chosen-Key Distinguishers on Reduced-Round AES

Abstract

In this paper, we study the AES block cipher in the chosen-key setting. The adversary's goal of this security model is to find triplets (m, m , k) satisfying some properties more efficiently for the AES scheme than generic attacks. It is a restriction of the classical chosen-key model, since as it has been defined originally, differences in the keys are possible. This model is related to the known-key setting, where the adversary receives a key k, and tries to find a pair of messages (m, m) that has some property more efficiently than generic attacks. Both models have been called open-key model in the literature and are interesting for the security of AES-based hash functions. Here, we show that in the chosen-key setting, attacking seven rounds (resp. eight rounds) of AES-128 can be done in time and memory 2 8 (resp. 2 24) while the generic attack would require 2 64 computations as a variant of the birthday paradox can be used to predict the generic complexity. We have checked our results experimentally and we extend them to distinguisers of AES-256.
Fichier principal
Vignette du fichier
indocrypt2012.pdf (604.95 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01094335 , version 1 (12-12-2014)

Identifiers

Cite

Patrick Derbez, Pierre-Alain Fouque, Jérémy Jean. Faster Chosen-Key Distinguishers on Reduced-Round AES. Progress in Cryptology - {INDOCRYPT} 2012, Dec 2012, Kolkata, India. pp.19, ⟨10.1007/978-3-642-34931-7_14⟩. ⟨hal-01094335⟩
154 View
265 Download

Altmetric

Share

Gmail Facebook X LinkedIn More