HIGHT算法的积分攻击
发布时间：2019-01-02 09:51
【摘要】：对轻量级分组密码算法HIGHT在积分攻击方法下的安全性进行了研究。首先纠正了现有研究成果在构造区分器时的不当之处,重新构造了HIGHT算法的11轮积分区分器,并构造了相应高阶积分扩展下的17轮区分器;其次利用所构造的17轮区分器,结合"时空折中"原理对25轮HIGHT算法进行了积分攻击;最后对攻击算法的复杂度进行了分析,攻击算法需要的数据复杂度为2~(62.92),时间复杂度为2~(66.20),空间复杂度为2~(119)。分析结果表明,所给出的攻击算法的攻击轮数和时间复杂度要优于现有研究结果。
[Abstract]:The security of lightweight block cipher algorithm HIGHT under integral attack is studied. Firstly, the shortcomings of the existing research results in the construction of classifiers are corrected, and the 11-round integrator of HIGHT algorithm is reconstructed, and the 17-round discriminator based on the corresponding higher-order integral extension is constructed. Secondly, 25 rounds of HIGHT algorithm are attacked by using the 17-wheel discriminator and the principle of "space-time compromise". Finally, the complexity of the attack algorithm is analyzed. The data complexity, time complexity and space complexity of the attack algorithm are 2 ~ (62.92), 2 ~ (66.20) and 2 ~ (119) respectively. The analysis results show that the number of attack rounds and the time complexity of the proposed attack algorithm are better than those of the existing research results.
【作者单位】： 解放军信息工程大学三院;信息保障技术重点实验室;西安卫星测控中心;
【基金】：中国博士后科学基金资助项目(No.2014M562582)~~
【分类号】：TN918.1
，
本文编号：2398347
[Abstract]:The security of lightweight block cipher algorithm HIGHT under integral attack is studied. Firstly, the shortcomings of the existing research results in the construction of classifiers are corrected, and the 11-round integrator of HIGHT algorithm is reconstructed, and the 17-round discriminator based on the corresponding higher-order integral extension is constructed. Secondly, 25 rounds of HIGHT algorithm are attacked by using the 17-wheel discriminator and the principle of "space-time compromise". Finally, the complexity of the attack algorithm is analyzed. The data complexity, time complexity and space complexity of the attack algorithm are 2 ~ (62.92), 2 ~ (66.20) and 2 ~ (119) respectively. The analysis results show that the number of attack rounds and the time complexity of the proposed attack algorithm are better than those of the existing research results.
【作者单位】： 解放军信息工程大学三院;信息保障技术重点实验室;西安卫星测控中心;
【基金】：中国博士后科学基金资助项目(No.2014M562582)~~
【分类号】：TN918.1
，
本文编号：2398347
本文链接：https://www.wllwen.com/kejilunwen/xinxigongchenglunwen/2398347.html
