Skip to Main content Skip to Navigation
Conference papers

Asynchrony Immune Cellular Automata

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 side-channel 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 asynchrony-immune rules are center-permutive, and we conjecture that this holds for any size of the neighborhood.
Complete list of metadatas
Contributor : Luca Mariot <>
Submitted on : Thursday, October 6, 2016 - 6:13:11 PM
Last modification on : Monday, October 12, 2020 - 10:30:32 AM




Luca Mariot. Asynchrony Immune Cellular Automata. 12th International Conference on Cellular Automata for Research and Industry, ACRI 2016, Sep 2016, Fez, Morocco. pp.176-181, ⟨10.1007/978-3-319-44365-2_17⟩. ⟨hal-01377343⟩



Record views