Detail výsledku

Bent Function Synthesis by Means of Cartesian Genetic Programming

HRBÁČEK, R.; DVOŘÁK, V. Bent Function Synthesis by Means of Cartesian Genetic Programming. In Parallel Problem Solving from Nature - PPSN XIII. Heidelberg: Springer Verlag, 2014. p. 414-423. ISBN: 978-3-319-10761-5.
Typ
článek ve sborníku konference
Jazyk
anglicky
Autoři
Hrbáček Radek, Ing., Ph.D., UPSY (FIT)
Dvořák Václav, prof. Ing., DrSc., UPSY (FIT)
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.

Klíčová slova


Cartesian Genetic Programming, Evolutionary Design, Bent Boolean Function, Parallel Computing

Rok
2014
Strany
414–423
Sborník
Parallel Problem Solving from Nature - PPSN XIII
Konference
Parallel Problem Solving from Nature 2014
ISBN
978-3-319-10761-5
Vydavatel
Springer Verlag
Místo
Heidelberg
DOI
10.1007/978-3-319-10762-2_41
UT WoS
000358196900041
EID Scopus
2-s2.0-84921485161
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"
}
Projekty
Pokročilé metody evolučního návrhu složitých číslicových obvodů, GAČR, Standardní projekty, GA14-04197S, zahájení: 2014-01-01, ukončení: 2016-12-31, ukončen
Výzkumné skupiny
Výzkumná skupina Evolvable Hardware (VZ EHW)
Pracoviště
Ústav počítačových systémů (UPSY)
Nahoru