Premium
New Concepts in Evolutionary Search for Boolean Functions in Cryptology
Author(s) -
Millan William,
Fuller Joanne,
Dawson Ed
Publication year - 2004
Publication title -
computational intelligence
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.353
H-Index - 52
eISSN - 1467-8640
pISSN - 0824-7935
DOI - 10.1111/j.0824-7935.2004.00246.x
Subject(s) - boolean function , cryptography , theoretical computer science , heuristics , computer science , boolean expression , boolean network , equivalence (formal languages) , mathematics , maximum satisfiability problem , standard boolean model , and inverter graph , algorithm , discrete mathematics , mathematical optimization
In symmetric cryptology the resistance to attacks depends critically on the nonlinearity properties of the Boolean functions describing cipher components like Substitution boxes (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.