Slide Attacks

  • Alex Biryukov
  • David Wagner
Conference paper

DOI: 10.1007/3-540-48519-8_18

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1636)
Cite this paper as:
Biryukov A., Wagner D. (1999) Slide Attacks. In: Knudsen L. (eds) Fast Software Encryption. FSE 1999. Lecture Notes in Computer Science, vol 1636. Springer, Berlin, Heidelberg


It is a general belief among the designers of block-ciphers that even a relatively weak cipher may become very strong if its number of rounds is made very large. In this paper we describe a new generic known- (or sometimes chosen-) plaintext attack on product ciphers, which we call the slide attack and which in many cases is independent of the number of rounds of a cipher. We illustrate the power of this new tool by giving practical attacks on several recently designed ciphers: TREYFER, WAKE-ROFB, and variants of DES and Blowfish.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Alex Biryukov
    • 1
  • David Wagner
    • 2
  1. 1.Applied Mathematics DepartmentTechnion - Israel Institute of TechnologyHaifaIsrael
  2. 2.University of CaliforniaBerkeley

Personalised recommendations