English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We continue the study of asynchrony immunity in cellular automata (CA), whichcan be considered as a weaker version of correlation immunity in the context ofvectorial Boolean functions. The property could have applications as acountermeasure for side-channel attacks in CA-based cryptographic primitives,such as S-boxes and pseudorandom number generators. We first give sometheoretical results on the necessary conditions that a CA rule must satisfy inorder to meet asynchrony immunity, the most important one being centerpermutivity. Next, we perform an exhaustive search of all asynchrony immune CArules of neighborhood size up to $5$, leveraging on the discovered theoreticalproperties to greatly reduce the size of the search space.

Search Space Reduction of Asynchrony Immune Cellular Automata by Center Permutivity