Part of the Lecture Notes in Computer Science book series (LNCS, volume 434)
How easy is collision search? Application to DES
Given a cryptographic algorithm f (depending upon a fixed message m and a key k), a pair of keys with collision k 1 and k 2 (in short, a collision) are keys such that f(m, k 1) = f(m, k 2).
KeywordsDistinguished Point Random Mapping Projection Function Basic Mode Data Encryption
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
- 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
- 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
© Springer-Verlag Berlin Heidelberg 1990