International Workshop on Fast Software Encryption

FSE 2011: Fast Software Encryption pp 35-54

Multiple Differential Cryptanalysis: Theory and Practice

  • Céline Blondeau
  • Benoît Gérard
Conference paper

DOI: 10.1007/978-3-642-21702-9_3

Volume 6733 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Blondeau C., Gérard B. (2011) Multiple Differential Cryptanalysis: Theory and Practice. In: Joux A. (eds) Fast Software Encryption. FSE 2011. Lecture Notes in Computer Science, vol 6733. Springer, Berlin, Heidelberg

Abstract

Differential cryptanalysis is a well-known statistical attack on block ciphers. We present here a generalisation of this attack called multiple differential cryptanalysis. We study the data complexity, the time complexity and the success probability of such an attack and we experimentally validate our formulas on a reduced version of PRESENT. Finally, we propose a multiple differential cryptanalysis on 18-round PRESENT for both 80-bit and 128-bit master keys.

Keywords

iterative block ciphermultiple differential cryptanalysisPRESENTdata complexitysuccess probabilitytime complexity
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Céline Blondeau
    • 1
  • Benoît Gérard
    • 1
  1. 1.SECRET Project-Team - INRIA Paris-RocquencourtLe Chesnay CedexFrance