Multiple Limited-Birthday Distinguishers and Applications

Jérémy Jean 1 María Naya-Plasencia 2 Thomas Peyrin 3
1 CASCADE - Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities
DI-ENS - Département d'informatique de l'École normale supérieure, Inria Paris-Rocquencourt, CNRS - Centre National de la Recherche Scientifique : UMR 8548
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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal.inria.fr/hal-00870452
Contributor : Jérémy Jean <>
Submitted on : Monday, October 7, 2013 - 12:54:28 PM
Last modification on : Thursday, February 7, 2019 - 3:49:23 PM
Long-term archiving on: Friday, April 7, 2017 - 7:55:52 AM

File

sac2013.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00870452, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

501

Files downloads

321