On the Design of Permutation P in DES Type Cryptosystems

This paper reviews some possible design criteria for the permutation P in a DES style cryptosystem. These permutations provide the diffusion component in a substitution-permutation network. Some empirical rules which seem to account for the derivation of the permutation used in the DES are first presented. Then it is noted that these permutations may be regarded as latin-squares which link the outputs of S-boxes to their inputs at the next stage. A subset of these with a regular structure, and which perform well in a dependency analysis are then presented. Some design rules are then derived, and it is suggested these be used to design permutations in future schemes for an extended version of the DES.

[1]  William Caelli.  Computer security in the age of information : proceedings of the Fifth IFIP International Conference on Computer Security, IFIP/Sec '88, Gold Coast, Queensland, Australia, 19-21 May, 1988 , 1989 .

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

[3]  Whitfield Diffie,et al.  Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard , 1977, Computer.

[4]  Martin E. Hellman.  I. `DES will be totally insecure within ten years¿ , 1979, IEEE Spectrum.

[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]  Donald W. Davies.  Some Regular Properties of the 'Data Encryption Standard' Algorithm , 1982, CRYPTO.

[7]  Jennifer Seberry,et al.  Cryptography - an introduction to computer security , 1991, Advances in computer science series.

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

[9]  Ralph Howard,et al.  Data encryption standard , 1987 .

[10]  R. Sugarman.  Communications: On foiling computer crime: Can a thief with lots of LSI chips crack present data scrambling schemes? The experts debate the matter , 1979, IEEE Spectrum.

[11]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[12]  J. Dénes,et al.  Latin squares and their applications , 1974 .

[13]  Joos Vandewalle,et al.  Analytical Characteristics of the DES , 1983, CRYPTO.