Cryptology ePrint Archive: Report 2015/259

Exhausting Demirci-Selšuk Meet-in-the-Middle Attacks against Reduced-Round AES

Patrick Derbez and Pierre-Alain Fouque

Abstract: 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.

Category / Keywords: secret-key cryptography / meet-in-the-middle, AES, automatic cryptanalysis, low data complexity

Original Publication (with minor differences): IACR-FSE-2013

Date: received 19 Mar 2015

Contact author: patrick derbez at uni lu

Available format(s): PDF | BibTeX Citation

Version: 20150322:083332 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]