Bent Function Synthesis by Means of Cartesian Genetic Programming

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F14%3APU111967" target="_blank" >RIV/00216305:26230/14:PU111967 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-10762-2_41" target="_blank" >http://dx.doi.org/10.1007/978-3-319-10762-2_41</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-10762-2_41" target="_blank" >10.1007/978-3-319-10762-2_41</a>

Result language
angličtina
Original language name
Bent Function Synthesis by Means of Cartesian Genetic Programming
Original language description
In this paper, a new approach to synthesize bent Boolean functions by means of Cartesian Genetic Programming (CGP) is proposed. Bent functions have important applications in cryptography due to their high nonlinearity. However, they are very rare and their discovery using conventional brute force methods is not efficient enough. We show that by using CGP we can routinely design bent functions of up to 16 variables. The evolutionary approach exploits parallelism in both the fitness calculation and the search algorithm.
Czech name
—
Czech description
—

Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GA14-04197S" target="_blank" >GA14-04197S: Advanced Methods for Evolutionary Design of Complex Digital Circuits</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)