Design of S-boxes Defined with Cellular Automata Rules

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

@InProceedings{Picek:2017:DSD:3075564.3079069,
  author =       "Stjepan Picek and Luca Mariot and Bohan Yang and 
                 Domagoj Jakobovic and Nele Mentens",
  title =        "Design of S-boxes Defined with Cellular Automata
                 Rules",
  booktitle =    "Proceedings of the Computing Frontiers Conference, CF
                 2017",
  year =         "2017",
  pages =        "409--414",
  address =      "Siena, Italy",
  publisher =    "ACM",
  keywords =     "genetic algorithms, genetic programming, Cellular
                 automata, Implementation, Lightweight cryptography,
                 S-boxes",
  isbn13 =       "978-1-4503-4487-6",
  URL =          "http://www.human-competitive.org/sites/default/files/picek-paper-2-acm.pdf",
  URL =          "http://www.human-competitive.org/sites/default/files/picek-text.txt",
  DOI =          "doi:10.1145/3075564.3079069",
  acmid =        "3079069",
  size =         "6 pages",
  abstract =     "The aim of this paper is to find cellular automata
                 (CA) rules that are used to describe S-boxes with good
                 cryptographic properties and low implementation cost.
                 Up to now, CA rules have been used in several ciphers
                 to define an S-box, but in all those ciphers, the same
                 CA rule is used. This CA rule is best known as the one
                 defining the Keccak x transformation. Since there
                 exists no straightforward method for constructing CA
                 rules that define S-boxes with good
                 cryptographic/implementation properties, we use a
                 special kind of heuristics for that -- Genetic
                 Programming (GP). Although it is not possible to
                 theoretically prove the efficiency of such a method,
                 our experimental results show that GP is able to find a
                 large number of CA rules that define good S-boxes in a
                 relatively easy way. We focus on the 4 x 4 and 5 x 5
                 sizes and we implement the S-boxes in hardware to
                 examine implementation properties like latency, area,
                 and power. Particularly interesting is the internal
                 encoding of the solutions in the considered heuristics
                 using combinatorial circuits; this makes it easy to
                 approximate S-box implementation properties like
                 latency and area a priori.",
  notes =        "Entered 2017 Humies
                 http://www.human-competitive.org/awards",
}

Genetic Programming entries for Stjepan Picek Luca Mariot Bohan Yang Domagoj Jakobovic Nele Mentens

Citations