Enumerating Nondegenerate Permutations

Every cryptosystem with an n-bit block length may be modeled as a system of n-bit boolean equations. The cipher is said to be nondegenerate if the equation fi that describes the output ci is nondegenerate, for 1 ≤ i ≤ n. Let Nn,n be the set of nondegenerate permutations. We will derive an exact expression for |Nn,n|, and show that Nn,n|/2n! = 1+o(√2n/22n-1+n).

[1]  Michael A. Harrison,et al.  Introduction to switching and automata theory , 1965 .

[2]  H. Feistel.  Cryptography and Computer Privacy , 1973 .

[3]  D. Coppersmith,et al.  Generators for Certain Alternating Groups with Applications to Cryptography , 1975 .

[4]  J.L. Smith,et al.  Some cryptographic techniques for machine-to-machine data communications , 1975, Proceedings of the IEEE.

[5]  Carl H. Meyer,et al.  Ciphertext/plaintext and ciphertext/key dependence vs. number of rounds for the data encryption standard , 1899, AFIPS National Computer Conference.

[6]  John B. Kam,et al.  Structured Design of Substitution-Permutation Encryption Networks , 1979, IEEE Transactions on Computers.

[7]  Alan G. Konheim.  Cryptography, a primer , 1981 .

[8]  F. Ayoub.  Probabilistic completeness of substitution-permutation encryption networks , 1982 .

[9]  J. A. Gordon,et al.  Are Big S-Boxes Best? , 1982, EUROCRYPT.

[10]  Oded Goldreich,et al.  DES-like functions can generate the alternating group , 1983, IEEE Trans. Inf. Theory.

[11]  Charles Cresson Wood,et al.  Security for computer networks : D.W. Davies and W.L. Price New York: John Wiley and Sons, 1984. 386 + xix pages, $19.50 , 1985, Computers & security.

[12]  D. Chaum,et al.  Cryptanalysis of DES with a reduced number of rounds , 1986, CRYPTO 1986.

[13]  Donald W. Davies,et al.  Security for computer networks - an introduction to data security in teleprocessing and electronic funds transfer (2. ed.) , 1989, Wiley series in communication and distributed systems.