Evolving S-boxes based on cellular automata with genetic programming (CROSBI ID 651569)
Prilog sa skupa u zborniku | sažetak izlaganja sa skupa | međunarodna recenzija
Podaci o odgovornosti
Picek, Stjepan ; Mariot, Luca ; Leporati, Alberto ; Jakobović, Domagoj
engleski
Evolving S-boxes based on cellular automata with genetic programming
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.
Substitution boxes, Genetic Programming, Cellular automata, Cryptography
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o prilogu
251-252.
2017.
objavljeno
Podaci o matičnoj publikaciji
Proceedings of the Genetic and Evolutionary Computation Conference Companion (GECCO '17)
978-1-4503-4939-0
Podaci o skupu
Genetic and Evolutionary Computation Conference, GECCO 2017
predavanje
15.07.2017-19.07.2017
Berlin, Njemačka