SIMON不可能差分及零相关路径自动化搜索算法

对于分组密码，不可能差分和零相关线性分析都是很重要的分析手段.通过研究非线性组件与（AND）的性质，首先得到用于刻画SIMON轮函数差分及线性传播特性的约束式，再基于布尔可满足约束问题（SAT），提出一种普适性不可能差分和零相关路径自动化搜索算法，并利用该算法搜索得到SIMON更多的不可能差分及零相关路径.除用于自动化搜索外，该算法还可判断特定的差分对（掩码对）是否能构成一条有效不可能差分和零相关路径.此外，基于该算法，从抵抗不可能差分攻击的角度出发，给出SIMON轮函数设计中循环移位常数的选取依据.

Automatic Search Algorithm for Impossible Differential Trials and Zero-Correlation Linear Trials in SIMON

Impossible differential cryptanalysis and zero-correlation linear cryptanalysis are two of the most useful cryptanalysis methods in the field of symmetric ciphers. Taking the non-linear components into consideration, this article proposes a method for searching the impossible differentials and zero-correlation linear approximations of SIMON based on a technique of SAT. In applications, the proposed method is used to find more impossible differentials and zero-correlation linear approximations for 11-round SIMON. Furthermore, this tool can be used to prove whether there are impossible differentials (zero-correlation linear approximations) in certain rounds of SIMON, particularly for certain subset of input and output patterns of differences (masks). Utilizing this tool, the security of SIMON as well as the choice of its parameter set when resisting the impossible differential cryptanalysis are also explored.