Search Space Reduction of Asynchrony Immune Cellular Automata by Center Permutivity

01/06/2019

∙

by   Luca Mariot, et al.

∙

0

∙

share

We continue the study of asynchrony immunity in cellular automata (CA), which can be considered as a weaker version of correlation immunity in the context of vectorial Boolean functions. The property could have applications as a countermeasure for side-channel attacks in CA-based cryptographic primitives, such as S-boxes and pseudorandom number generators. We first give some theoretical results on the necessary conditions that a CA rule must satisfy in order to meet asynchrony immunity, the most important one being center permutivity. Next, we perform an exhaustive search of all asynchrony immune CA rules of neighborhood size up to 5, leveraging on the discovered theoretical properties to greatly reduce the size of the search space.