How easy is collision search. New results and applications to DES
Given a cryptographic algorithm f (depending upon a fixed message m and a key k), a pair of keys with collision k 0 and k 1 (in short, a collision) are keys such that f(m,k 0) = f(m,k 1).
The existence of collisions for a cryptographic algorithm means that this algorithm is not faithful in a precise technical sense (see ).
KeywordsEfficient Algorithm Distinguished Point Mathematical Foundation Specific Algorithm Data Encryption
- Don Coppersmith, Mathematical foundations of cryptography, 1989, in preparation.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
- 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
- Jean-Jacques Quisquater and Jean-Paul Delescaille, How easy is collision search. Application to DES, Proceedings of EUROCRYPT’ 89, To appear.Google Scholar