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 × 4 up to 7 × 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.
Picek, S., Mariot, L., Leporati, A., Jakobovic, D. (2017). Evolving S-boxes based on cellular automata with genetic programming. In GECCO '17 Proceedings of the Genetic and Evolutionary Computation Conference (pp.251-252). Association for Computing Machinery, Inc [10.1145/3067695.3076084].
Evolving S-boxes based on cellular automata with genetic programming
MARIOT, LUCASecondo
;LEPORATI, ALBERTO OTTAVIOPenultimo
;
2017
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 × 4 up to 7 × 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.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
