How easy is collision search? Application to DES

  • Jean-Jacques Quisquater
  • Jean-Paul Delescaille
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 434)

Abstract

Given a cryptographic algorithm f (depending upon a fixed message m and a key k), a pair of keys with collision k1 and k2 (in short, a collision) are keys such that f(m, k1) = f(m, k2).

References

  1. [1]
    Robert Sedgewick, Thomas G. Szymanski and Andrew C. Yao, The complexity of finding cycles in periodic functions, SIAM J. Comput., vol. 11,2, pp. 376–390, 1982.MATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    Jean-Jacques Quisquater and Jean-Paul Delescaille, Other cycling tests for DES, Springer Verlag, Lecture notes in computer science 293, Advances in cryptology, Proceedings of CRYPTO’ 87, pp. 255–256.Google Scholar
  3. [3]
    Burton Kaliski, Ronald Rivest and Alan Sherman, Is the Data Encryption Standard a group? (Results of cycling experiments on DES)?, J. Cryptology, vol. 1,198, pp. 3–36.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Jean-Jacques Quisquater
    • 1
  • Jean-Paul Delescaille
    • 1
  1. 1.Philips Research Laboratory BelgiumLouvain-la-NeuveBelgium

Personalised recommendations