Abstract
We prove that the set of DES permutations (encryption and decryption for each DES key) is not closed under functional composition. This implies that, in general, multiple DES-encryption is not equivalent to single DES-encryption, and that DES is not susceptible to a particular known-plaintext attack which requires, on average, 228 steps. We also show that the size of the subgroup generated by the set of DES permutations is greater than 102499, which is too large for potential attacks on DES which would exploit a small subgroup.
Chapter PDF
Similar content being viewed by others
References
D. Coppersmith, “In Defense of DES”, personal communication, July 1992 (This work was also described briefly in a posting to sci.crypt on Usenet News, 1992 May 18).
D. Coppersmith, “The Real Reason for Rivest’s Phenomenon”, Advances in Cryptology-Crypto’ 85 Proceedings, Springer-Verlag, New York, pp. 535–536.
Data Encryption Standard, Federal Information Processing Standards Publication 46, National Bureau of Standards, U.S. Department of Commerce, Washington, DC (1977 Jan. 15).
B.S. Kaliski, R.L. Rivest, and A.T. Sherman, “Is the Data Encryption Standard a Group? (Results of Cycling Experiments on DES)”, Journal of Cryptology, vol. 1 (1988), no. 1, pp. 3–36.
J.H. Moore and G.J. Simmons, “Cycle Structure of the DES with Weak and Semi-weak Keys”, Advances in Cryptology-Crypto’ 86 Proceedings, Springer-Verlag, New York, pp. 9–32.
H. Morita, K. Ohta, and S. Miyaguchi, “A Switching Closure Test to Analyze Cryptosystems”, Advances in Cryptology-Crypto’ 91 Proceedings, Springer-Verlag, New York, pp. 183–193.
J.-J. Quisquater and J.-P. Delescaille, “How easy is collision search? Application to DES”, Advances in Cryptology-Eurocrypt 89 Proceedings, Springer-Verlag, New York, pp. 429–434.
J.-J. Quisquater and J.-P. Delescaille, “How easy is collision search. New results and applications to DES”, Advances in Cryptology-Crypto’ 89 Proceedings, Springer-Verlag, New York, pp. 408–413.
R. Sedgewick, T.G. Szymanski, and A.C. Yao, “The complexity of finding cycles in periodic functions”, Siam Journal on Computing, vol. 11 (1982), no. 2, pp. 376–390.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Campbell, K.W., Wiener, M.J. (1993). DES is not a Group. In: Brickell, E.F. (eds) Advances in Cryptology — CRYPTO’ 92. CRYPTO 1992. Lecture Notes in Computer Science, vol 740. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48071-4_36
Download citation
DOI: https://doi.org/10.1007/3-540-48071-4_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57340-1
Online ISBN: 978-3-540-48071-6
eBook Packages: Springer Book Archive