- author = "Stjepan Picek and Luca Mariot and Alberto Leporati and Domagoj Jakobovic",
- title = "Evolving {S-boxes} Based on Cellular Automata with Genetic Programming",
- booktitle = "Proceedings of GECCO 2017 Companion",
- year = "2017",
- month = "15-19 " # jul,
- pages = "251--252",
- organisation = "SIGEVO",
- address = "Berlin",
- publisher = "ACM",
- publisher_address = "New York, NY, USA",
- keywords = "genetic algorithms, genetic programming: poster, cellular automata, cryptography, substitution boxes",
- isbn13 = "978-1-4503-4939-0",
-
URL = "
http://www.human-competitive.org/sites/default/files/picek-paper-1-gecco.pdf",
-
URL = "
http://www.human-competitive.org/sites/default/files/picek-text.txt",
-
URL = "http://doi.acm.org/10.1145/3067695.3076084",
-
DOI = "
doi:10.1145/3067695.3076084",
- acmid = "3076084",
- size = "2 pages",
- abstract = "The design of cryptographically strong Substitution Boxes (S-boxes) is an interesting problem from both a cryptographic perspective as well as the combinatorial optimization one. Here we introduce the concept of evolving cellular automata rules that can be then translated into S-boxes. With it, we are able to find optimal S-boxes for sizes from 4 by 4 up to 7 by 7. As far as we know, this is the first time a heuristic approach is able to find optimal S-boxes for sizes larger than 4.",
-
notes = "Entered 2017 Humies
http://www.human-competitive.org/awards
notes = {Also known as \cite{Picek:2017:GECCOb}, \cite{Picek:2017:ESB:3067695.3076084} GECCO-2017 A Recombination of the 26th International Conference on Genetic Algorithms (ICGA-2017) and the 22nd Annual Genetic Programming Conference (GP-2017)},",
