Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S

TLDR: This work investigates the computational power of block ciphers on n-bit strings that can be expressed as polynomial-length compositions of invertible transformations that have a form similar to those of D.E.S.S., and presents some sufficient conditions for cipher of this type to be "pseudorandom function generators" and to yield private key cryptosystems that are secure against adaptive chosen plaintext attacks.

Abstract: 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.