SHACAL-2算法中非线性函数的差分特性及其应用

发布时间：2018-05-07 20:43

本文选题：密码学 + SHACAL-算法　；参考：《电子与信息学报》2014年07期

【摘要】：SHACAL-2算法是欧洲NESSIE计划推荐的分组密码标准算法之一,选择函数和主函数是SHACAL-2算法中两类基本的非线性函数。该文分析了这两类非线性函数的差分特性,证明了当选择函数的第1个位置输入差分非零或者主函数的前两个位置中任意一个输入差分非零时(其它位置差分均为零),对应差分方程解的个数仅与输入差分的重量有关。将这一特性引入到SHACHL-2算法的差分故障攻击中,结果表明至少需要160个随机故障才能使该攻击以超过60%的成功概率恢复512 bit的种子密钥,至少需要240个随机故障才能以超过98%的成功概率恢复512 bit的种子密钥。
[Abstract]:The SHACAL-2 algorithm is one of the standard block cipher algorithms recommended by the European NESSIE Program. The selection function and the main function are two basic nonlinear functions in the SHACAL-2 algorithm. In this paper, the difference characteristics of these two kinds of nonlinear functions are analyzed. It is proved that the number of solutions of the corresponding difference equation is only related to the weight of the input difference when the first position of the selected function is input nonzero or any one of the first two positions of the main function is not 00:00 (the difference of the other positions is all zero). This characteristic is introduced into the differential fault attack of SHACHL-2 algorithm. The results show that at least 160 random faults are needed to make the attack recover the seed key of 512 bit with more than 60% probability of success. At least 240 random faults are needed to recover the seed key of 512 bit with more than 98% probability of success.
【作者单位】：国防科技大学理学院;国防科技大学电子科学与工程学院;国防科技大学计算机学院;
【基金】：国家自然科学基金(61103192) 国家973计划项目(2013CB338002)资助课题
【分类号】：TN918

【参考文献】