Print Email Facebook Twitter Search space reduction of asynchrony immune cellular automata Title Search space reduction of asynchrony immune cellular automata Author Mariot, L. (TU Delft Cyber Security) Manzoni, Luca (University of Trieste) Dennunzio, Alberto (Università degli Studi di Milano Bicocca) Date 2020 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. Subject Asynchrony immunityCellular automataCorrelation immunityCryptographyNonlinearityPermutivitySide-channel attacks To reference this document use: http://resolver.tudelft.nl/uuid:9a51e254-fc91-40c9-ac92-463b57c57d1e DOI https://doi.org/10.1007/s11047-020-09788-1 ISSN 1567-7818 Source Natural Computing, 19 (2), 287-293 Part of collection Institutional Repository Document type journal article Rights © 2020 L. Mariot, Luca Manzoni, Alberto Dennunzio Files PDF Mariot2020_Article_Search ... ynchro.pdf 378.01 KB Close viewer /islandora/object/uuid:9a51e254-fc91-40c9-ac92-463b57c57d1e/datastream/OBJ/view