Encyclopedia of Cryptography and Security

2011 Edition
| Editors: Henk C. A. van Tilborg, Sushil Jajodia

Slide Attack

  • Alex Biryukov
Reference work entry
DOI: https://doi.org/10.1007/978-1-4419-5906-5_617

Related Concepts

Definition

Slide attack is generic attack designed by Biryukov and Wagner [ 12]. It can be applied in both known plaintext or chosen plaintext scenarios. It can be viewed as a variant of a related key attack, in which a relation of the key with itself is exploited. The main feature of this attack is that it realizes a dream of cryptanalysts: if the cipher is vulnerable to such an attack, the complexity of the attack is independent of the number of rounds of the cipher. A typical slide of one encryption against another by one round (under the same key) is shown in Fig.  1.
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Biryukov A, Wagner D (1999) Slide attacks. In: Knudsen LR (ed) Proceedings of Fast Software Encryption – FSE’99. Lecture notes in computer science, vol 1636. Springer, Berlin, pp 245–259CrossRefGoogle Scholar
  2. 2.
    Biryukov A, Wagner D (2000) Advanced slide attacks. In: Preneel B (ed) Advances in cryptology – EUROCRYPT 2000. Lecture notes in computer science, vol 1807. Springer, Berlin, pp 589–606CrossRefGoogle Scholar
  3. 3.
    Brown L, Seberry J (1990) Key scheduling in DES type cryptosystems. In: Seberry J, Pieprzyk J (eds) Advances in cryptology – AUSCRYPT’90. Lecture notes in computer science, vol 453. Springer, Berlin, pp 221–228CrossRefGoogle Scholar
  4. 4.
    Even S, Mansour Y (1997) A construction of a cipher from a single pseudorandom permutation. J Cryptol 10(3):151–162zbMATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    Biham E, Dunkelman O, Keller N (2007) Improved Slide Attacks. In: Biryukov A (ed) Proceedings of fast software encryption – FSE’07. Lecture notes in computer science, vol 4593. Springer, Berlin, pp 153–166CrossRefGoogle Scholar
  6. 6.
    Saarinen M-JO (2003) Cryptyanalysis of block ciphers based on SHA-1 and MD5. In: Johansson T (ed) Proceedings of fast software encryption – FSE 2003. Lecture notes in computer science, vol 2887. Springer, Berlin, pp 36–44CrossRefGoogle Scholar
  7. 7.
    Gorski M, Lucks S, Peyrin T (2008) Slide attacks on a class of hash functions. In: Preneel B (ed) Advances in cryptology – ASIACRYPT 2008. Lecture notes in computer science, vol 5350. Springer, Berlin, pp 143–160CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  • Alex Biryukov
    • 1
  1. 1.FDEF, Campus LimpertsbergUniversity of LuxembourgLuxembourgLuxembourg