On Welch-Gong Transformation Sequence Generators
SAC '00 Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography
Boolean Functions with Large Distance to All Bijective Monomials: N Odd Case
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Further Results Related to Generalized Nonlinearity
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
On the Interpolation Attacks on Block Ciphers
FSE '00 Proceedings of the 7th International Workshop on Fast Software Encryption
Affine equivalence in the AES round function
Discrete Applied Mathematics
Affine equivalence in the AES round function
Discrete Applied Mathematics
Improved rijndael-like s-box and its transform domain analysis
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Dickson polynomials, hyperelliptic curves and hyper-bent functions
SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications
| Hi-index | 754.84 |
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