Fighting the symmetries: The structure of cryptographic boolean function spaces

Stjepan Picek, R. I. McKay, Roberto Santana, Tom D. Gedeon

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    13 Citations (Scopus)

    Abstract

    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 is generally noted, with implications for crossover and for distributional methods. We explore the large-scale plateau structure of the problem, with similar implications for local search. We show that symmetries yield additional information that may yield more effective search methods.

    Original languageEnglish
    Title of host publicationGECCO 2015 - Proceedings of the 2015 Genetic and Evolutionary Computation Conference
    EditorsSara Silva
    PublisherAssociation for Computing Machinery (ACM)
    Pages457-464
    Number of pages8
    ISBN (Electronic)9781450334723
    DOIs
    Publication statusPublished - 11 Jul 2015
    Event16th Genetic and Evolutionary Computation Conference, GECCO 2015 - Madrid, Spain
    Duration: 11 Jul 201515 Jul 2015

    Publication series

    NameGECCO 2015 - Proceedings of the 2015 Genetic and Evolutionary Computation Conference

    Conference

    Conference16th Genetic and Evolutionary Computation Conference, GECCO 2015
    Country/TerritorySpain
    CityMadrid
    Period11/07/1515/07/15

    Fingerprint

    Dive into the research topics of 'Fighting the symmetries: The structure of cryptographic boolean function spaces'. Together they form a unique fingerprint.

    Cite this