基于中心置换的异步免疫元胞自动机搜索空间缩减
Search Space Reduction of Asynchrony Immune Cellular Automata by Center Permutivity
摘要:
我们继续研究元胞自动机(CA)中的异步免疫,它可以被认为是向量布尔函数背景下相关免疫的较弱版本。该属性可以应用于基于CA的密码原语(如S盒和伪随机数生成器)中的侧信道攻击的对策。首先给出了CA规则满足免疫性的必要条件的理论结果,其中最重要的条件是中心置换性。接下来,我们执行一个穷举搜索的所有免疫CA规则的邻域大小高达$5$,利用发现的理论属性,大大减少搜索空间的大小。
英文摘要:
We continue the study of asynchrony immunity in cellular automata (CA), which can be considered as a weaker version of correlation immunity in the context 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 necessary conditions that a CA rule must satisfy in order to meet asynchrony immunity, the most important one being center 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。