Nonlinearity criteria for cryptographic functions
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Linear cryptanalysis method for DES cipher
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
An effective genetic algorithm for finding highly nonlinear Boolean Functions
ICICS '97 Proceedings of the First International Conference on Information and Communication Security
Differential Cryptanalysis of DES-like Cryptosystems
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Auto-correlations and new bounds on the nonlinearity of boolean functions
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Evolving Boolean Functions Satisfying Multiple Criteria
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
| Hi-index | 0.00 |
This paper outlines a general approach to the iterative incremental improvement of the cryptographic properties of arbitrary Boolean functions. These methods, which are known as hill climbing, offer a fast way to obtain Boolean functions that have properties superior to those of randomly generated functions. They provide a means to improve the attainable compromise between conflicting cryptographic criteria. We give an overview of the different options available, concentrating on reducing the maximum value of the Walsh-Hadamard transform and autocorrelation function. A user selected heuristic allows the methods to be flexible. Thus we obtain Boolean functions that are locally optimal with regard to one or more important cryptographic properties such as nonlinearity and global autocorrelation.