Paper 2013/521
Multiple Limited-Birthday Distinguishers and Applications
Jérémy Jean, María Naya-Plasencia, and Thomas Peyrin
Abstract
In this article, we propose a new improvement of the rebound techniques, used for cryptanalyzing AES-like permutations during the past years. Our improvement, that allows to reduce the complexity of the attacks, increases the probability of the outbound part by considering a new type of differential paths. Moreover, we propose a new type of distinguisher, the multiple limited-birthday problem, based on the limited-birthday one, but where differences on the input and on the output might have randomized positions. We also discuss the generic complexity for solving this problem and provide a lower bound of it as well as we propose an efficient and generic algorithm for solving it. Our advances lead to improved distinguishing or collision results for many AES-based functions such as AES, ECHO, Grøstl, LED, PHOTON and Whirlpool.
Note: long version of the SAC 2013 article
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Published elsewhere. Minor revision. SAC 2013
- Keywords
- AES-like permutationdistinguisherslimited-birthdayrebound attack
- Contact author(s)
- thomas peyrin @ gmail com
- History
- 2013-08-30: received
- Short URL
- https://ia.cr/2013/521
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2013/521,
author = {Jérémy Jean and María Naya-Plasencia and Thomas Peyrin},
title = {Multiple Limited-Birthday Distinguishers and Applications},
howpublished = {Cryptology {ePrint} Archive, Paper 2013/521},
year = {2013},
url = {https://eprint.iacr.org/2013/521}
}
