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.
This work was supported in part by the Research Council K.U.Leuven: GOA TENSE (GOA/11/007), by the IAP Programme P6/26 BCRYPT of the Belgian State (Belgian Science Policy), and in part by the European Commission through the ICT programme under contract ICT-2007-216676 ECRYPT II.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Borst, J.: Block Ciphers: Design, Analysis and Side-Channel Analysis. PhD thesis, Katholieke Universiteit Leuven, Bart Preneel and Joos Vandewalle, promotors (2001)
Dorothy, E.: Cryptography and Data Security, p. 100. Addison-Wesley, Reading (1982)
Flajolet, P., Odlyzko, A.M.: Random Mapping Statistics. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1998. LNCS, vol. 434, pp. 329–354. Springer, Heidelberg (1990)
Hellman, M.E.: A cryptanalytic time-memory trade-off. IEEE Transactions on Information Theory 26(4), 401–406 (1980)
Knuth, D.E.: The Art of Computer Programming: Seminumerical Algorithms, 3rd edn. Addison-Wesley, Reading (1997)
National Bureau of Standards, U.S. Deparment of Commerce. Data Encryption Standard. Federal Information Processing Standards Publication 46 (1977)
Nivasch, G.: Cycle detection using a stack. Information Processing Letters 90, 135–140 (2004)
Quisquater, J.-J., Delescaille, J.-P.: How Easy Is Collision Search. New Results and Applications to DES. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 408–413. Springer, Heidelberg (1990)
Quisquater, J.-J., Delescaille, J.-P.: How Easy Is Collision Search? Application to DES. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 429–434. Springer, Heidelberg (1990)
van Oorschot, P.C., Wiener, M.J.: Parallel collision search with cryptanalytic applications. J. Cryptology 12(1), 1–28 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Indesteege, S., Preneel, B. (2012). DES Collisions Revisited. In: Naccache, D. (eds) Cryptography and Security: From Theory to Applications. Lecture Notes in Computer Science, vol 6805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28368-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-28368-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28367-3
Online ISBN: 978-3-642-28368-0
eBook Packages: Computer ScienceComputer Science (R0)