Name
Title | ||
|---|---|---|
Cartesian Genetic Programming Approach for Generating Substitution Boxes of Different Sizes |
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1145/2739482.2764698 | Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation |
DocType | Citations | PageRank |
Conference | 6 | 0.45 |
References | Authors | |
2 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stjepan Picek | 1 | 164 | 44.70 |
| Julian F. Miller | 2 | 16 | 1.35 |
| Domagoj Jakobovic | 3 | 195 | 29.01 |
| Lejla Batina | 4 | 1488 | 107.99 |