Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikačního výsledku
HRBÁČEK, R.; DVOŘÁK, V.
Originální název
Bent Function Synthesis by Means of Cartesian Genetic Programming
Anglický název
Druh
Stať ve sborníku v databázi WoS či Scopus
Originální abstrakt
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.
Anglický abstrakt
Klíčová slova
Cartesian Genetic Programming, Evolutionary Design, Bent Boolean Function, Parallel Computing
Klíčová slova v angličtině
Autoři
Rok RIV
2015
Vydáno
13.09.2014
Nakladatel
Springer Verlag
Místo
Heidelberg
ISBN
978-3-319-10761-5
Kniha
Parallel Problem Solving from Nature - PPSN XIII
Strany od
414
Strany do
423
Strany počet
10
BibTex
@inproceedings{BUT111562, author="Radek {Hrbáček} and Václav {Dvořák}", title="Bent Function Synthesis by Means of Cartesian Genetic Programming", booktitle="Parallel Problem Solving from Nature - PPSN XIII", year="2014", pages="414--423", publisher="Springer Verlag", address="Heidelberg", doi="10.1007/978-3-319-10762-2\{_}41", isbn="978-3-319-10761-5" }