Title :
Transform domain analysis of DES
Author :
Gong, Guang ; Golomb, Solomon W.
Author_Institution :
Commun. Sci. Inst., Univ. of Southern California, Los Angeles, CA, USA
fDate :
9/1/1999 12:00:00 AM
Abstract :
The Data Encryption Standard (DES) can be regarded as a nonlinear feedback shift register (NLFSR) with input. From this point of view, the tools for pseudo-random sequence analysis are applied to the S-boxes in DES. The properties of the S-boxes of DES under the Fourier transform, Hadamard transform, extended Hadamard transform, and the Avalanche transform are investigated. Two important results about the S-boxes of DES are found. The first result is that nearly two-thirds of the total 32 functions from GF (26) to GF(2) which are associated with the eight S-boxes of DES have the maximal linear span G3, and the other one-third have linear span greater than or equal to 57. The second result is that for all S-boxes, the distances of the S-boxes approximated by monomial functions has the same distribution as for the S-boxes approximated by linear functions. Some new criteria for the design of permutation functions for use in block cipher algorithms are discussed
Keywords :
Fourier transforms; Galois fields; Hadamard transforms; binary sequences; code standards; cryptography; telecommunication standards; Avalanche transform; DES; Data Encryption Standard; Fourier transform; Galois fields; Hadamard transform; NLFSR; S-boxes; block cipher algorithms; extended Hadamard transform; input; linear functions; maximal linear span; monomial functions; nonlinear feedback shift register; permutation functions design; pseudo-random sequence analysis; transform domain analysis; Algorithm design and analysis; Cryptography; Data security; Feedback; Fourier transforms; Internet; Linear approximation; NIST; National security; Shift registers;
Journal_Title :
Information Theory, IEEE Transactions on