Multiple Limited-Birthday Distinguishers and Applications - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Multiple Limited-Birthday Distinguishers and Applications

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, Groestl, LED, PHOTON and Whirlpool.
Fichier principal
Vignette du fichier
sac2013.pdf (579.78 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00870452 , version 1 (07-10-2013)

Identifiers

  • HAL Id : hal-00870452 , version 1

Cite

Jérémy Jean, María Naya-Plasencia, Thomas Peyrin. Multiple Limited-Birthday Distinguishers and Applications. Selected Areas in Cryptography - SAC 2013, Aug 2013, Vancouver, Canada. pp.533--550. ⟨hal-00870452⟩
252 View
203 Download

Share

Gmail Facebook X LinkedIn More