Title :
New concepts in evolutionary search for Boolean functions in cryptology
Author :
Millan, William ; Fuller, Joanne ; Dawson, Ed
Author_Institution :
Inf. Security Res. Center, Queensland Univ. of Technol., Brisbane, Qld., Australia
Abstract :
In symmetric cryptology (which is an essential part of modern computer security), the resistance to attacks depends critically on the nonlinearity properties of the Boolean functions describing cipher components like S-boxes. Some of the most effective methods known to generate functions that satisfy multiple criteria are based on evolutionary heuristics. In this paper, we improve on these algorithms by employing an adaptive strategy. Additionally, using recent improvements in the understanding of these combinatorial structures, we discover essential properties of the graph formed by affine equivalence classes of Boolean functions, which offers several advantages as a conceptual model for multiobjective seeking evolutionary heuristics. Finally, we propose the first major global cooperative effort to discover new bounds for cryptographic properties of Boolean functions.
Keywords :
Boolean functions; cryptography; equivalence classes; evolutionary computation; heuristic programming; search problems; Boolean functions; S-boxes; adaptive strategy; affine equivalence classes; cipher components; combinatorial structures; computer security; cryptology; evolutionary heuristics; evolutionary search; Algorithm design and analysis; Australia; Boolean functions; Computer security; Costs; Cryptography; Data security; Galois fields; Information security; NIST;
Conference_Titel :
Evolutionary Computation, 2003. CEC '03. The 2003 Congress on
Print_ISBN :
0-7803-7804-0
DOI :
10.1109/CEC.2003.1299939
