Exhausting Demirci-Selçuk Meet-in-the-Middle Attacks Against Reduced-Round AES

Patrick Derbez (1) , Pierre-Alain Fouque (2, 3)

1 CASCADE - Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities
2 UR - Université de Rennes
3 IUF - Institut universitaire de France

In this paper, we revisit Demirci and Selçuk meet-in-the-middle attacks on AES. We find a way to automatically model SPN block cipher and meet-in-the-middle attacks that allows to perform exhaustive search of this kind of attacks. This search uses the tool developed by Bouillaguet, Derbez and Fouque at CRYPTO 2011 as a subroutine to solve specific systems. We also take into account ideas introduced by Dunkelman, Keller and Shamir at ASIACRYPT 2010 which can be seen as a new tradeoff of the classical time/memory tradeoff used by Demirci and Selçuk. As a result, we automatically recover all the recent improved attacks of Derbez, Fouque and Jean on AES and we show new improved attacks against 8-rounds of AES-192 and AES-256.

Domaines: Cryptographie et sécurité [cs.CR]

Patrick Derbez, Pierre-Alain Fouque. Exhausting Demirci-Selçuk Meet-in-the-Middle Attacks Against Reduced-Round AES. Fast Software Encryption - 20th International Workshop, {FSE} 2013, Mar 2013, singapore, Singapore. pp.20, ⟨10.1007/978-3-662-43933-3_28⟩. ⟨hal-01094309⟩