Abstract
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).
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
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.
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.
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.
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? 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. https://doi.org/10.1007/3-540-46885-4_43
Download citation
DOI: https://doi.org/10.1007/3-540-46885-4_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53433-4
Online ISBN: 978-3-540-46885-1
eBook Packages: Springer Book Archive