Publication detail

Bent Function Synthesis by Means of Cartesian Genetic Programming

HRBÁČEK, R. DVOŘÁK, V.

Original Title

Bent Function Synthesis by Means of Cartesian Genetic Programming

Type

conference paper

Language

English

Original Abstract

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.

Keywords

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

Authors

HRBÁČEK, R.; DVOŘÁK, V.

RIV year

2014

Released

13. 9. 2014

Publisher

Springer Verlag

Location

Heidelberg

ISBN

978-3-319-10761-5

Book

Parallel Problem Solving from Nature - PPSN XIII

Pages from

414

Pages to

423

Pages count

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"
}