The aim of this paper is to find cellular automata (CA) rules that are used to describe S-boxes with good cryptographic properties and low implementation cost. Up to now, CA rules have been used in several ciphers to define an S-box, but in all those ciphers, the same CA rule is used. This CA rule is best known as the one defining the Keccak χ transformation. Since there exists no straightforward method for constructing CA rules that define S-boxes with good cryptographic/implementation properties, we use a special kind of heuristics for that -- Genetic Programming (GP). Although it is not possible to theoretically prove the efficiency of such a method, our experimental results show that GP is able to find a large number of CA rules that define good S-boxes in a relatively easy way. We focus on the 4 x 4 and 5 x 5 sizes and we implement the S-boxes in hardware to examine implementation properties like latency, area, and power. Particularly interesting is the internal encoding of the solutions in the considered heuristics using combinatorial circuits; this makes it easy to approximate S-box implementation properties like latency and area a priori.

Picek, S., Mariot, L., Yang, B., Jakobovic, D., Mentens, N. (2017). Design of S-boxes defined with cellular automata rules. In ACM International Conference on Computing Frontiers 2017, CF 2017 (pp.409-414). Association for Computing Machinery, Inc [10.1145/3075564.3079069].

Design of S-boxes defined with cellular automata rules

MARIOT, LUCA
Secondo
;
2017

Abstract

The aim of this paper is to find cellular automata (CA) rules that are used to describe S-boxes with good cryptographic properties and low implementation cost. Up to now, CA rules have been used in several ciphers to define an S-box, but in all those ciphers, the same CA rule is used. This CA rule is best known as the one defining the Keccak χ transformation. Since there exists no straightforward method for constructing CA rules that define S-boxes with good cryptographic/implementation properties, we use a special kind of heuristics for that -- Genetic Programming (GP). Although it is not possible to theoretically prove the efficiency of such a method, our experimental results show that GP is able to find a large number of CA rules that define good S-boxes in a relatively easy way. We focus on the 4 x 4 and 5 x 5 sizes and we implement the S-boxes in hardware to examine implementation properties like latency, area, and power. Particularly interesting is the internal encoding of the solutions in the considered heuristics using combinatorial circuits; this makes it easy to approximate S-box implementation properties like latency and area a priori.
paper
Lightweight cryptography, S-boxes, Cellular automata, Genetic programming, Implementation
English
ACM International Conference on Computing Frontiers 2017
2017
ACM International Conference on Computing Frontiers 2017, CF 2017
9781450344876
2017
409
414
none
Picek, S., Mariot, L., Yang, B., Jakobovic, D., Mentens, N. (2017). Design of S-boxes defined with cellular automata rules. In ACM International Conference on Computing Frontiers 2017, CF 2017 (pp.409-414). Association for Computing Machinery, Inc [10.1145/3075564.3079069].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/163721
Citazioni
  • Scopus 37
  • ???jsp.display-item.citation.isi??? 17
Social impact