The D.E.S. cipher is naturally viewed as a composition of sixteen invertible transformations on 64-bit strings (where the transformations depend of the value of a 56-bit key). Each of the transformations has a special form and satisfies the particular property that each of its output bits is determined by a “small” number of its input bits. We investigate the computational power of block ciphers on n-bit strings that can be expressed as polynomial-length (with respect to n) compositions of invertible transformations that have a form similar to those of D.E.S. In particular, we require that the basic transformations have the property that each of their output bits depends on the value of a small number of their input bits (where “small” is somewhere in the range between O(1) and O(log n)). We present some sufficient conditions for ciphers of this type to be “pseudorandom function generators” and, thus, to yield private key cryptosystems that are secure against adaptive chosen plaintext attacks.
- Block Cipher
- Boolean Circuit
- Pseudorandom Function
- Data Encryption Standard
- Permutation Generator
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.
Research partially conducted while the author was at the University of Toronto, partially supported by an NSERC postgraduate scholarship, and at the International Computer Science Institute in Berkeley, CA.
D. A. Barrington, “Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC1,” J. Computer System Sci. Vol. 38, pp. 150–164, 1989.
M. Ben-Or, and R. Cleve, “Computing Algebraic Formulas Using a Constant Number of Registers,” Proc. 20th Ann. ACM Symp. on Theory of Computing, pp. 254–257, 1988.
R. Cleve, Methodologies for Designing Block Ciphers and Cryptographic Protocols (Part I), Ph.D. Thesis, University of Toronto, 1989.
D. Coppersmith, and E. Grossman, “Generators for Certain Alternating Groups with Applications to Cryptography,” SIAM J. Appl. Math., pp. 624–627, 1975.
D. Coppersmith, “Cryptography,” IBM J. Res. Develop., Vol. 31, No. 2, pp. 244–248, 1987.
S. Even, and O. Goldreich, “DES-Like Functions Can Generate the Alternating Group,” IEEE Trans. on Information Theory, pp. 863–865, 1983.
Luby, M., and C. Rackoff, “How to Construct Pseudorandom Permutations From Pseudorandom Functions,” SIAM J. Comput., Vol. 17, No. 2, pp. 373–386, 1988.
E. Biham, and A. Shamir, “Differential Cryptanalysis of DES-like Cryptosystems,” these proceedings, 1990.
Editors and Affiliations
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cleve, R. (1991). Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S.. In: Menezes, A.J., Vanstone, S.A. (eds) Advances in Cryptology-CRYPTO’ 90. CRYPTO 1990. Lecture Notes in Computer Science, vol 537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-38424-3_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54508-8
Online ISBN: 978-3-540-38424-3
eBook Packages: Springer Book Archive