Advanced Slide Attacks

  • Alex Biryukov
  • David Wagner
Conference paper

DOI: 10.1007/3-540-45539-6_41

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1807)
Cite this paper as:
Biryukov A., Wagner D. (2000) Advanced Slide Attacks. In: Preneel B. (eds) Advances in Cryptology — EUROCRYPT 2000. EUROCRYPT 2000. Lecture Notes in Computer Science, vol 1807. Springer, Berlin, Heidelberg

Abstract

Recently a powerful cryptanalytic tool—the slide attack—was introduced [3]. Slide attacks are very successful in breaking iterative ciphers with a high degree of self-similarity and even more surprisingly are independent of the number of rounds of a cipher. In this paper we extend the applicability of slide attacks to a larger class of ciphers. We find very efficient known- and chosen-text attacks on generic Feistel ciphers with a periodic key-schedule with four independent subkeys, and consequently we are able to break a DES variant proposed in [2] using just 128 chosen texts and negligible time for the analysis (for one out of every 216 keys). We also describe known-plaintext attacks on DESX and Even-Mansour schemes with the same complexity as the best previously known chosen-plaintext attacks on these ciphers. Finally, we provide new insight into the design of GOST by successfully analyzing a 20-round variant (GOST⊕) and demonstrating weak key classes for all 32 rounds.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Alex Biryukov
    • 1
    • 2
  • David Wagner
    • 3
  1. 1.Applied Mathematics DepartmentTechnion - Israel Institute of TechnologyHaifaIsrael
  2. 2.Computer Science DepartmentThe Weizmann Institute of ScienceRehovotIsrael
  3. 3.University of CaliforniaBerkeley

Personalised recommendations