Bent Function Synthesis by Means of Cartesian Genetic Programming

Created by W.Langdon from gp-bibliography.bib Revision:1.4524

  author =       "Radek Hrbacek and Vaclav Dvorak",
  title =        "Bent Function Synthesis by Means of Cartesian Genetic
  booktitle =    "13th International Conference on Parallel Problem
                 Solving from Nature",
  year =         "2014",
  editor =       "Thomas Bartz-Beielstein and Juergen Branke and 
                 Bogdan Filipic and Jim Smith",
  publisher =    "Springer",
  isbn13 =       "978-3-319-10761-5",
  pages =        "414--423",
  series =       "Lecture Notes in Computer Science",
  address =      "Ljubljana, Slovenia",
  month =        "13-17 " # sep,
  volume =       "8672",
  keywords =     "genetic algorithms, genetic programming, Cartesian
                 Genetic Programming",
  DOI =          "doi:10.1007/978-3-319-10762-2_41",
  abstract =     "In this paper, a new approach to synthesise 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.",
  notes =        "Winner Bronze at 11th Annual Humies Awards 2014
                 Vancouver, British Columbia


Genetic Programming entries for Radek Hrbacek Vaclav Dvorak