Linear Nonequivalence versus Nonlinearity

The choice of a collection of cryptographically strong Boolean functions is crucial in designing a strong hashing algorithm. The paper shows that it is possible to obtain five linearly nonequivalent functions with five Boolean variables which are cryptographically strong and easy to implement. They can be readily used to design hashing algorithms (of the MD5 structure).

[1]  Joos Vandewalle,et al.  Propagation Characteristics of Boolean Functions , 1991, EUROCRYPT.

[2]  Eli Biham,et al.  Differential Cryptanalysis of Snefru, Khafre, REDOC-II, LOKI and Lucifer , 1991, CRYPTO.

[3]  Elwyn R. Berlekamp,et al.  Weight distributions of the cosets of the (32, 6) Reed-Muller code , 1972, IEEE Trans. Inf. Theory.

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

[5]  Kaisa Nyberg,et al.  On the Construction of Highly Nonlinear Permutations , 1992, EUROCRYPT.

[6]  D. Slepian.  On The Number of Symmetry Types of Boolean Functions of n Variables , 1953, Canadian Journal of Mathematics.

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

[8]  Ronald L. Rivest,et al.  The MD5 Message-Digest Algorithm , 1992, RFC.

[9]  Jennifer Seberry,et al.  Key Scheduling In Des Type Cryptosystems , 1990, AUSCRYPT.

[10]  Stafford E. Tavares,et al.  Constructing Large Cryptographically Strong S-boxes , 1992, AUSCRYPT.

[11]  Stafford E. Tavares,et al.  On the Design of S-Boxes , 1985, CRYPTO.

[12]  Carlisle M. Adams,et al.  On Immunity Against Biham and Shamir's "Differential Cryptanalysis" , 1992, Information Processing Letters.

[13]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[14]  Reihaneh Safavi-Naini.  Parallel Generation of Pseudo-Random Sequences , 1990, AUSCRYPT.

[15]  Jennifer Seberry,et al.  HAVAL - A One-Way Hashing Algorithm with Variable Length of Output , 1992, AUSCRYPT.

[16]  Jennifer Seberry,et al.  On the Design of Permutation P in DES Type Cryptosystems , 1990, EUROCRYPT.

[17]  Réjane Forré,et al.  The Strict Avalanche Criterion: Spectral Properties of Boolean Functions and an Extended Definition , 1988, CRYPTO.

[18]  Josef Pieprzyk,et al.  Towards effective nonlinear cryptosystem design , 1988 .

[19]  Luke James O'Connor.  An analysis of product ciphers based on the properties of boolean functions , 1992 .

[20]  Willi Meier,et al.  Nonlinearity Criteria for Cryptographic Functions , 1990, EUROCRYPT.

[21]  W. Burnside,et al.  Theory of Groups of Finite Order , 1909 .

[22]  Kaisa Nyberg,et al.  Constructions of Bent Functions and Difference Sets , 1991, EUROCRYPT.

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

[24]  Kaisa Nyberg,et al.  Perfect Nonlinear S-Boxes , 1991, EUROCRYPT.

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