Search space reduction of asynchrony immune cellular automata

Luca Mariot*, Luca Manzoni, Alberto Dennunzio

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

2 Citations (Scopus)
55 Downloads (Pure)


We continue the study of asynchrony immunity in cellular automata (CA), which can be considered as a generalization of correlation immunity in the case 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 properties that a CA rule must satisfy in order to meet asynchrony immunity, like central 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.

Original languageEnglish
Pages (from-to)287-293
Number of pages7
JournalNatural Computing
Issue number2
Publication statusPublished - 2020


  • Asynchrony immunity
  • Cellular automata
  • Correlation immunity
  • Cryptography
  • Nonlinearity
  • Permutivity
  • Side-channel attacks


Dive into the research topics of 'Search space reduction of asynchrony immune cellular automata'. Together they form a unique fingerprint.

Cite this