Asynchrony Immune Cellular Automata - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Asynchrony Immune Cellular Automata

Résumé

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.
Fichier non déposé

Dates et versions

hal-01377343 , version 1 (06-10-2016)

Identifiants

Citer

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⟩
75 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More