Abstract
During summer 1985, we performed eight cycling experiments on the Data Encryption Standard (DES) to see if DES has certain algebraic weaknesses. Using special-purpose hardware, we applied the cycling closure test described in our Eurocrypt 85 paper to determine whether DES is a pure cipher. We also carried out a stronger version of this test. (A cipher is pure if, for any keys i, j, k, there exists some key l such that T i T j −1 T k = T l, where T w denotes encryption under key w.) In addition, we followed the orbit of a randomly chosen DES transformation for 236 steps, as well as the orbit of the composition of two of the “weak key” transformations. Except for the weak key experiment, our results are consistent with the hypothesis that DES acts like a set of randomly chosen permutations. In particular, our results show with overwhelming confidence that DES is not pure. The weak key experiment produced a short cycle of about 233 steps, the consequence of hitting a fixed point for each weak key.
December 1985
This research is supported by NSF grant MCS-8006938 and IBM.
Chapter PDF
Key Words and Phrases
References
Beth, Thomas, ed., Cryptography, Proceedings of the Workshop on Cryptography, Burg Feuerstein, Germany, March 29–April 2, 1982, Springer (Berlin, 1983).
Bovey, J. D., “An approximate probability distribution for the order of elements of the symmetric group,” Bull. London Math Society, 12 (1980), 41–46.
Bovey, John; and Alan Williamson, “The probability of generating the symmetric group,” Bull. London Math Society, 10 (1978), 91–96.
Carmichael, Robert D., Introduction to the Theory of Groups of Finite Order, Dover (New York, 1956).
Chaum, David; Ronald L. Rivest; and Alan T. Sherman, eds., Advances in Cryptology: Proceedings of Crypto 82, Plenum Press (New York, 1983).
Davies, Donald W.; and W. L. Price, Security for Computer Networks: An Introduction to Data Security in Teleprocessing and Electronic Funds Transfer, John Wiley (Chichester, England, 1984).
Davies, Donald W., “Some regular properties of the DES,” in [CRS82], 89–96.
Davies, Donald W.; and G. I. P. Parkin, “The average size of the key stream in output feedback mode,” in [CRS82], 97–98.
Davies, Donald W.; and G. I. P. Parkin, “The average size of the key stream in output feedback encipherment,” in [Bet82], 263–279.
Dixon, John D., “The probability of generating the symmetric group,” Math Zentrum, 110 (1969), 199–205.
“Data Encryption Standard,” National Bureau of Standards, Federal Information Processing Standards Publications No. 46 (January 15, 1977).
“DES modes of operations,” Federal Information Standards Publication No. 81 (December 1980).
Gait, Jason, “A new nonlinear pseudorandom number generator,” IEEE Transactions on Software Engineering, SE-3 (September 1977), 359–363.
Harris, Bernard, “Probability distributions related to random mappings,” Annals of Math. Statistics, 31 (1959), 1045–1062.
Hellman, Martin E., et al., “Results of an initial attempt to cryptanalyze the NBS Data Encryption Standard,” technical report SEL 76-042, Information Systems Laboratory, Stanford Univ. (November 1976).
Hellman, Martin E.; and Justin M. Reyneri, “Distribution of Drainage in the DES,” in [CRS82] (1982), 129–131.
Jueneman, Robert R., “Analysis of certain aspects of output-feedback mode,” in [CRS82] (1982), 99–127.
Kaliski, Burton S., Jr.; Ronald L. Rivest; and Alan T. Sherman, “Is the Data Encryption Standard a Group?” Proceedings of Eurocrypt 85, Springer, to appear.
Knuth, Donald E., Seminumerical Algorithms in The Art of Computer Programming, vol. 2, Addison-Wesley (1969).
Merkle, Ralph C.; and Martin E. Hellman, “On the security of multiple encryption,” CACM, 24 (July 1981), 465–467.
Meyer, Carl H.; and Stephen M. Matyas, Cryptology: A New Dimension in Computer Data Security, John Wiley (New York, 1982).
Purdom, Paul W.; and J. H. Williams, “Cycle length in a random function,” Transactions of the American Mathematics Society, 133 (1968), 547–551.
Rotman, Joseph J., The Theory of Groups: An Introduction, Allyn and Bacon (Boston, 1978).
Shannon, Claude E., “Communication theory of secrecy systems,” Bell System Technical Journal, 28 (October 1949), 656–715.
Sedgewick, Robert; Thomas G. Szymanski; and Andrew C. Yao, “The complexity of finding cycles in periodic functions,” Siam Journal of Computing, 11 (1982), 376–390.
Shepp, L. A.; and S. P. Lloyd, “Ordered cycle lengths in a random permutation,” Transactions of the American Mathematics Society, (February 1966), 340–357.
Tuchman, W. L., talk presented at National Computer Conference, (June 1978).
Wielandt, Helmut, Finite Permutation Groups, Academic Press (New York, 1964).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaliski, B.S., Rivest, R.L., Sherman, A.T. (1986). Is DES a Pure Cipher? (Results of More Cycling Experiments on DES) (Preliminary Abstract). In: Williams, H.C. (eds) Advances in Cryptology — CRYPTO ’85 Proceedings. CRYPTO 1985. Lecture Notes in Computer Science, vol 218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39799-X_17
Download citation
DOI: https://doi.org/10.1007/3-540-39799-X_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16463-0
Online ISBN: 978-3-540-39799-1
eBook Packages: Springer Book Archive