Cryptology ePrint Archive: Report 2017/1055

Cellular Automata Based S-boxes

Luca Mariot and Stjepan Picek and Alberto Leporati and Domagoj Jakobovic

Abstract: The design of Substitution Boxes (S-boxes) with good cryptographic properties represents an interesting problem. In this paper, we investigate how to evolve cellular automata (CA) rules that can be then translated into S-boxes. We first prove some upper bounds for the nonlinearity and differential uniformity of S-boxes generated by CA rules. Next, we employ a heuristic technique called Genetic Programming in order to generate CA based S-boxes with good cryptographic properties. Finally, we use the same heuristic paradigm in order to investigate whether a certain S-box is obtainable by a single CA rule.

Category / Keywords: secret-key cryptography / Cellular Automata, S-box, Cryptographic properties, Heuristics

Date: received 28 Oct 2017

Contact author: luca mariot at disco unimib it

Available format(s): PDF | BibTeX Citation

Version: 20171031:152226 (All versions of this report)

Short URL: ia.cr/2017/1055

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]