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.
Type de document :
Communication dans un congrès
12th International Conference on Cellular Automata for Research and Industry, ACRI 2016, Sep 2016, Fez, Morocco. 9863, pp.176-181, 2016, Lecture Notes in Computer Science. 〈https://sites.google.com/a/complexworld.net/acri2016/〉. 〈10.1007/978-3-319-44365-2_17〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01377343
Contributeur : Luca Mariot <>
Soumis le : jeudi 6 octobre 2016 - 18:13:11
Dernière modification le : lundi 4 décembre 2017 - 15:14:11

Identifiants

Collections

Citation

Luca Mariot. Asynchrony Immune Cellular Automata. 12th International Conference on Cellular Automata for Research and Industry, ACRI 2016, Sep 2016, Fez, Morocco. 9863, pp.176-181, 2016, Lecture Notes in Computer Science. 〈https://sites.google.com/a/complexworld.net/acri2016/〉. 〈10.1007/978-3-319-44365-2_17〉. 〈hal-01377343〉

Partager

Métriques

Consultations de la notice

33