Paper 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.
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- A minor revision of an IACR publication in FSE 2013
- Keywords
- meet-in-the-middleAESautomatic cryptanalysislow data complexity
- Contact author(s)
- patrick derbez @ uni lu
- History
- 2015-03-22: received
- Short URL
- https://ia.cr/2015/259
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2015/259,
author = {Patrick Derbez and Pierre-Alain Fouque},
title = {Exhausting Demirci-Selçuk Meet-in-the-Middle Attacks against Reduced-Round {AES}},
howpublished = {Cryptology {ePrint} Archive, Paper 2015/259},
year = {2015},
url = {https://eprint.iacr.org/2015/259}
}
