Multiple Limited-Birthday Distinguishers and Applications
Jérémy Jean, María Naya‐Plasencia, Thomas Peyrin · Lecture notes in computer science · 2014
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 .