Evolving S-boxes based on cellular automata with genetic programming
Lists
Only you see this
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.
BibTeX
@inproceedings{picek2017evolving,
author = {Stjepan Picek and Luca Mariot and Alberto Leporati and Domagoj Jakobovic},
title = {{Evolving S-boxes based on cellular automata with genetic programming}},
booktitle = {GECCO (Companion)},
year = {2017},
doi = {10.1145/3067695.3076084},
}Loading related content...