Fighting the Symmetries: The Structure of Cryptographic Boolean Function Spaces
We explore the problem space of maximum nonlinearity problems for balanced Boolean functions, examining the symmetry structure and fitness landscapes in the most common (bit string) representation. We present theoretical analyses of well understood aspects, together with detailed enumeration of the 4-bit problem, sampling of the 6-bit problem based on known optima, and sampling of the 8-bit problem based on its fittest known solutions. We show that these problems have many more symmetries than...[Show more]
|Collections||ANU Research Publications|
|Source:||GECCO '15 Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation|
|01_Picek_Fighting_the_Symmetries%3A_The_2015.pdf||837.01 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.