Abstract
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 [2]).
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Don Coppersmith, Mathematical foundations of cryptography, 1989, in preparation.
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.
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.
Jean-Jacques Quisquater and Jean-Paul Delescaille, How easy is collision search. Application to DES, Proceedings of EUROCRYPT’ 89, To appear.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Quisquater, JJ., Delescaille, JP. (1990). How easy is collision search. New results and applications to DES. In: Brassard, G. (eds) Advances in Cryptology — CRYPTO’ 89 Proceedings. CRYPTO 1989. Lecture Notes in Computer Science, vol 435. Springer, New York, NY. https://doi.org/10.1007/0-387-34805-0_38
Download citation
DOI: https://doi.org/10.1007/0-387-34805-0_38
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97317-3
Online ISBN: 978-0-387-34805-6
eBook Packages: Springer Book Archive