DES collisions revisited

Authors:
Sebastiaan Indesteege;Bart Preneel
Affiliations:
Department of Electrical Engineering ESAT/COSIC, Katholieke Universiteit Leuven, Heverlee, Belgium;Interdisciplinary Institute for BroadBand Technology (IBBT), Ghent, Belgium
Venue:
Cryptography and Security
Year:
2012

Citing 5
Cited 0

Random mapping statistics

EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
How easy is collision search? Application to DES

EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
How Easy is Collision Search. New Results and Applications to DES

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Cycle detection using a stack

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We revisit the problem of finding key collisions for the DES block cipher, twenty two years after Quisquater and Delescaille demonstrated the first DES collisions. We use the same distinguished points method, but in contrast to their work, our aim is to find a large number of collisions. A simple theoretical model to predict the number of collisions found with a given computational effort is developed, and experimental results are given to validate this model.