Cartesian Genetic Programming Approach for Generating Substitution Boxes of Different Sizes

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

@InProceedings{Picek:2015:GECCOcomp,
  author =       "Stjepan Picek and Julian F. Miller and 
                 Domagoj Jakobovic and Lejla Batina",
  title =        "Cartesian Genetic Programming Approach for Generating
                 Substitution Boxes of Different Sizes",
  booktitle =    "GECCO Companion '15: Proceedings of the Companion
                 Publication of the 2015 Annual Conference on Genetic
                 and Evolutionary Computation",
  year =         "2015",
  editor =       "Sara Silva and Anna I Esparcia-Alcazar and 
                 Manuel Lopez-Ibanez and Sanaz Mostaghim and Jon Timmis and 
                 Christine Zarges and Luis Correia and Terence Soule and 
                 Mario Giacobini and Ryan Urbanowicz and 
                 Youhei Akimoto and Tobias Glasmachers and 
                 Francisco {Fernandez de Vega} and Amy Hoover and Pedro Larranaga and 
                 Marta Soto and Carlos Cotta and Francisco B. Pereira and 
                 Julia Handl and Jan Koutnik and Antonio Gaspar-Cunha and 
                 Heike Trautmann and Jean-Baptiste Mouret and 
                 Sebastian Risi and Ernesto Costa and Oliver Schuetze and 
                 Krzysztof Krawiec and Alberto Moraglio and 
                 Julian F. Miller and Pawel Widera and Stefano Cagnoni and 
                 JJ Merelo and Emma Hart and Leonardo Trujillo and 
                 Marouane Kessentini and Gabriela Ochoa and Francisco Chicano and 
                 Carola Doerr",
  isbn13 =       "978-1-4503-3488-4",
  keywords =     "genetic algorithms, genetic programming, cartesian
                 genetic programming: Poster",
  pages =        "1457--1458",
  month =        "11-15 " # jul,
  organisation = "SIGEVO",
  address =      "Madrid, Spain",
  URL =          "http://doi.acm.org/10.1145/2739482.2764698",
  DOI =          "doi:10.1145/2739482.2764698",
  publisher =    "ACM",
  publisher_address = "New York, NY, USA",
  abstract =     "Substitution Boxes (S-boxes) play an important role in
                 many modern-day cryptography algorithms. Indeed,
                 without carefully chosen S-boxes many ciphers would be
                 easy to break. The design of suitable S-boxes attracts
                 a lot of attention in cryptography community. The
                 evolutionary algorithms (EAs) community also had
                 several attempts to evolve S-boxes with good
                 cryptographic properties. When using EAs one usually
                 uses permutation representation in order to preserve
                 the bijectivity of the resulting S-boxes. In this paper
                 we experiment with Cartesian Genetic Programming (CGP)
                 and Genetic Programming (GP) in order to evolve
                 bijective S-boxes of various sizes that have good
                 cryptographic properties. Besides the standard CGP
                 representation, we use an approach that allows CGP and
                 GP to be mapped to the permutation encoding.",
  notes =        "Also known as \cite{2764698} Distributed at
                 GECCO-2015.",
}

Genetic Programming entries for Stjepan Picek Julian F Miller Domagoj Jakobovic Lejla Batina

Citations