We introduce the notion of asynchrony immunity for cellular automata (CA), which can be considered as a generalization of correlation immunity in the case of boolean functions. The property could have applications in cryptography, namely as a countermeasure for sidechannel attacks in CA-based cryptographic primitives. We give some preliminary results about asynchrony immunity, and we perform an exhaustive search of (3, 10)-asynchrony immune CA rules of neighborhood size 3 and 4. We finally observe that all discovered asynchronyimmune rules are center-permutive, and we conjecture that this holds for any size of the neighborhood.
Mariot, L. (2016). Asynchrony immune cellular automata. In 12th International Conference on Cellular Automata for Research and Industry, ACRI 2016; Fez; Morocco; 5-8 September 2016 (pp.176-181). Springer Verlag [10.1007/978-3-319-44365-2_17].
Asynchrony immune cellular automata
MARIOT, LUCA
Primo
2016
Abstract
We introduce the notion of asynchrony immunity for cellular automata (CA), which can be considered as a generalization of correlation immunity in the case of boolean functions. The property could have applications in cryptography, namely as a countermeasure for sidechannel attacks in CA-based cryptographic primitives. We give some preliminary results about asynchrony immunity, and we perform an exhaustive search of (3, 10)-asynchrony immune CA rules of neighborhood size 3 and 4. We finally observe that all discovered asynchronyimmune rules are center-permutive, and we conjecture that this holds for any size of the neighborhood.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
