How easy is collision search? Application to DES

  • Jean-Jacques Quisquater
  • Jean-Paul Delescaille
Conference paper

DOI: 10.1007/3-540-46885-4_43

Part of the Lecture Notes in Computer Science book series (LNCS, volume 434)
Cite this paper as:
Quisquater JJ., Delescaille JP. (1990) How easy is collision search? Application to DES. In: Quisquater JJ., Vandewalle J. (eds) Advances in Cryptology — EUROCRYPT ’89. EUROCRYPT 1989. Lecture Notes in Computer Science, vol 434. Springer, Berlin, Heidelberg


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).

Download to read the full conference paper text

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