Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s11047-020-09788-1 | Natural Computing |
Keywords | DocType | Volume |
Cellular automata, Cryptography, Asynchrony immunity, Correlation immunity, Nonlinearity, Side-channel attacks, Permutivity | Journal | 19 |
Issue | ISSN | Citations |
2 | 1567-7818 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luca Mariot | 1 | 47 | 11.35 |
| Luca Manzoni | 2 | 488 | 55.19 |
| alberto dennunzio | 3 | 318 | 38.17 |