Paper Info
Title
Evolving Algebraic Constructions for Designing Bent Boolean Functions.
Abstract
The evolution of Boolean functions that can be used in cryptography is a topic well studied in the last decades. Previous research, however, has focused on evolving Boolean functions directly, and not on general methods that are capable of generating the desired functions. The former approach has the advantage of being able to produce a large number of functions in a relatively short time, but it directly depends on the size of the search space. In this paper, we present a method to evolve algebraic constructions for generation of bent Boolean functions. To strengthen our approach, we define three types of constructions and give experimental results for them. Our results show that this approach is able to produce a large number of constructions, which could in turn enable the construction of many more Boolean functions with a larger number of variables.
Year
DOI
Venue
2016
10.1145/2908812.2908915
GECCO
Keywords
Field
DocType
Boolean Functions, Cryptography, Genetic Programming, Algebraic Constructions, Evolution, Secondary Constructions
Boolean function,Maximum satisfiability problem,Discrete mathematics,Mathematical optimization,Boolean circuit,Computer science,Bent function,Theoretical computer science,Standard Boolean model,Boolean expression,And-inverter graph,Two-element Boolean algebra
Conference
Citations 
PageRank 
References 
5
0.44
16
Authors
2
Name
Order
Citations
PageRank
Stjepan Picek116444.70
Domagoj Jakobovic219529.01