Skip to main content
  • 114 Accesses

Slide attack is generic attack designed by Biryukov and Wagner [1, 2]. 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 ciphel. A typical slide of one encryption against another by one round (under the same key) is shown in Figure 1. If the equation \(F_1 (P_0, K_1) = P_1\) holds, the pair is called a slid pair. The attacker would then obtain two equations:

$$ F_1(P_0,K_1) = P_1,\quad\qquad F_r(C_0,K_r) = C_1, $$

where the second equation would hold for free due to sliding. These equations involve only a single round function, and thus could be solved by the attacker for the secret subkeys \(K_1, K_r\) of these rounds. The attacker may create properly slid...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

References

  1. Biryukov, A. and D. Wagner (1999). “Slide attacks.” Proceedings of Fast Software Encryption—FSE'99, Lecture Notes in Computer Science, vol. 1636, ed. L.R. Knudsen. Springer-Verlag, Berlin, 245–259.

    Google Scholar 

  2. Biryukov, A. and D. Wagner (2000). “Advanced slide attacks.” Advances in Cryptology—EUROCRYPT 2000, Lecture Notes in Computer Science, vol. 1807, ed. B. Preneel. Springer-Verlag, Berlin, 589–606.

    Google Scholar 

  3. Brown, L. and J. Seberry (1990). “Key scheduling in DES type cryptosystems.” Advances in Cryptology—AUSCRYPT'90, Lecture Notes in Computer Science, vol. 453, eds. J. Seberry and J. Pieprzyk. Springer-Verlag, Berlin, 221–228.

    Google Scholar 

  4. Even, S. and Y. Mansour (1997). “A construction of a cipher from a single pseudorandom permutation.” Journal of Cryptology, 10 (3), 151–162.

    MATH  MathSciNet  Google Scholar 

  5. Saarinen, M.-J.O. (2003). “Cryptyanalysis of block ciphers based on SHA-1 and MD5.” Proceedings of Fast Software Encryption—FSE 2003, Lecture Notes in Computer Science, vol. 2887, ed. T. Johansson. Springer-Verlag, Berlin, 36–44.

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 International Federation for Information Processing

About this entry

Cite this entry

Biryukov, A. (2005). Slide Attack. In: van Tilborg, H.C.A. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA . https://doi.org/10.1007/0-387-23483-7_402

Download citation

Publish with us

Policies and ethics