论文部分内容阅读
cube集合的选取是cube攻击中的关键问题,也是最耗时的阶段.本文采用时空折中思想,设计一种新的搜索算法.选择一个维度较大的指标集,进行一次标准cube攻击,同时存储该指标集每个向量对应的cube和,对指标集的每个子集求取cube和时,只需将相应向量对应值相加即可,这样通过对一个cube集合的运算,可以诱导出多个线性方程.将此方法应用到缩减轮数的Grain-v1算法,对于初始化轮数为70轮的Grain-v1算法,可直接恢复18比特密钥,并找到关于另外28比特密钥的5个线性表达式.对于初始化轮数为75轮的Grain-v1算法,可以直接恢复14比特密钥,并找到了关于另外28比特密钥的6个线性表达式.
The selection of cube set is the key issue in cube attack, which is also the most time-consuming phase.In this paper, a new search algorithm is designed using the idea of space-time compromise, and a standard cube attack is selected with a larger dimension Store the cube corresponding to each vector of the indicator set, and obtain the cube sum for each subset of the indicator set, only the corresponding values of the corresponding vectors need to be added together, so that more operations can be induced on a cube set Linear equations.This method is applied to the Grain-v1 algorithm of reducing the number of rounds, for the Grain-v1 algorithm with an initial round of 70 rounds, the 18-bit key can be directly recovered and 5 information about the other 28-bit keys can be found Linear Expressions For the Grain-v1 algorithm, which initializes rounds of 75, the 14-bit key can be recovered directly and 6 linear expressions for the other 28-bit keys can be found.