Boolean Function Design Using Hill Climbing Methods
ACISP '99 Proceedings of the 4th Australasian Conference on Information Security and Privacy
Two-Stage Optimisation in the Design of Boolean Functions
ACISP '00 Proceedings of the 5th Australasian Conference on Information Security and Privacy
An effective genetic algorithm for finding highly nonlinear Boolean Functions
ICICS '97 Proceedings of the First International Conference on Information and Communication Security
Improved Upper Bound on the Nonlinearity of High Order Correlation Immune Functions
SAC '00 Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography
Nonlinearity Bounds and Constructions of Resilient Boolean Functions
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
On Resilient Boolean Functions with Maximal Possible Nonlinearity
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
Autocorrelation Properties of Correlation Immune Boolean Functions
INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
On the Constructing of Highly Nonlinear Resilient Boolean Functions by Means of Special Matrices
INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
New Constructions of Resilient Boolean Functions with Maximal Nonlinearity
FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
Construction of nonlinear boolean functions with important cryptographic properties
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
On the norm and covering radius of the first-order Reed-Muller codes
IEEE Transactions on Information Theory
Modifications of Patterson-Wiedemann functions for cryptographic applications
IEEE Transactions on Information Theory
Further constructions of resilient Boolean functions with very high nonlinearity
IEEE Transactions on Information Theory
The design of S-boxes by simulated annealing
New Generation Computing - Evolutionary computation
Rotation symmetric Boolean functions-Count and cryptographic properties
Discrete Applied Mathematics
Constructions of almost optimal resilient Boolean functions on large even number of variables
IEEE Transactions on Information Theory
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On using genetic algorithms for intrinsic side-channel resistance: the case of AES S-box
Proceedings of the First Workshop on Cryptography and Security in Computing Systems
| Hi-index | 0.06 |
Many desirable properties have been identified for Boolean functions with cryptographic applications. Obtaining optimal tradeoffs among such properties is hard. In this paper we show how simulated annealing, a search technique inspired by the cooling processes of molten metals, can be used to derive functions with profiles of cryptographically-relevant properties as yet unachieved by any other technique.