论文部分内容阅读
PRESENT算法是一个SPN结构的轻量级分组密码算法,适用于计算资源有限的环境与设备.差分分析是攻击分组密码最为基本和有效的方法之一,对于迭代31轮的PRESENT算法,目前最好的差分分析结果是16轮,使用明文全空间2~(64)个选择明文.本文在原有差分分析结果的基础上,根据线性P置换的扩散性质,得出在相邻两轮中活动S盒的数目与S盒差分值的汉明重量之间的关系.搜索差分路径时取不同位置的活动S盒,比较6轮差分路径的结果,在得到最多结果的位置上寻找14轮概率为2~(-62)的差分路径,从解密方向找到119个,从加密方向找到28个.在成功率为99%的情况下,将16轮多差分输入值-单差分输出值分析结果的数据量由原来的2~(64)个选择明文降低到2~(59.16)个,时间复杂度由原来的2~(64)次内存访问降低到2~(59.16)次,存储复杂度由原来的2~(32)个6比特计数器降低到2~(32)个3比特计数器.同时给出单差分输入值-多差分输出值的差分分析结果,数据量为2~(61.16)个选择密文,时间复杂度为2~(61.16)次内存访问,存储复杂度为2~(32)个4比特计数器.
PRESENT algorithm is a SPN lightweight packet cipher algorithm, which is suitable for computing environment and equipment with limited resources.Difference analysis is one of the most basic and effective methods to attack block cipher. For the iterative 31 round PRESENT algorithm, it is the best , The result of differential analysis is 16 rounds and the plaintext is used in the whole space of 2 ~ (64) plaintexts.On the basis of the original differential analysis results, based on the diffusion properties of linear P substitution, And the Hamming weight of the S-box differential value.Searching the differential path takes the active S-boxes of different positions and compares the result of the 6-path differential path to find the 14 rounds with the probability of 2 ~ (-62) differential paths, find 119 from the decryption direction, from the encryption direction to find 28. In the case of 99% success rate, the 16 rounds of differential input value - single difference output value analysis results of the data from The original 2 ~ (64) choices are reduced to 2 ~ (59.16) plains, the time complexity is reduced from 2 ~ (64) memory accesses to 2 ~ (59.16) times, the storage complexity is reduced from 2 ~ (32) 6-bit counter down to 2 ~ (32) 3-bit counter at the same time The results show that the data is 2 ~ (61.16) selected ciphertexts, the time complexity is 2 ~ (61.16) times of memory access, the storage complexity is 2 ~ (32) 4-bit counter.