首页 | 本学科首页   官方微博 | 高级检索  
     

HIGHT算法的积分攻击
引用本文:郭建胜,崔竞一,潘志舒,刘翼鹏.HIGHT算法的积分攻击[J].通信学报,2016,37(7):71-78.
作者姓名:郭建胜  崔竞一  潘志舒  刘翼鹏
作者单位:1. 解放军信息工程大学三院,河南 郑州 450001;2. 信息保障技术重点实验室,北京 100072;3. 西安卫星测控中心,陕西 西安 710043
基金项目:中国博士后科学基金资助项目(No.2014M562582)
摘    要:对轻量级分组密码算法HIGHT在积分攻击方法下的安全性进行了研究。首先纠正了现有研究成果在构造区分器时的不当之处,重新构造了HIGHT算法的11轮积分区分器,并构造了相应高阶积分扩展下的17轮区分器;其次利用所构造的17轮区分器,结合“时空折中”原理对25轮HIGHT算法进行了积分攻击;最后对攻击算法的复杂度进行了分析,攻击算法需要的数据复杂度为262.92,时间复杂度为266.20,空间复杂度为2119。分析结果表明,所给出的攻击算法的攻击轮数和时间复杂度要优于现有研究结果。

关 键 词:密码分析  分组密码  积分攻击  HIGHT算法

Integral attack on HIGHT block cipher
Jian-sheng GUO,Jing-yi CUI,Zhi-shu PAN,Yi-peng LIU.Integral attack on HIGHT block cipher[J].Journal on Communications,2016,37(7):71-78.
Authors:Jian-sheng GUO  Jing-yi CUI  Zhi-shu PAN  Yi-peng LIU
Affiliation:1. The Third Department, The PLA Information Engineering University, Zhengzhou 450001, China;2. Science and Technology on Information Assurance Laboratory, Beijing 100072, China;3. Xi'an Satellite Control Center, Xi'an 710043, China
Abstract:The security of HIGHT block cipher under integral attack was studied. Firstly, the flaw in the existing results on building the distinguisher was corrected. And a new 11-round integral distinguisher of HIGHT was built. Based on this new distinguisher, a 17-round multiple-integral distinguisher was built. By using the 17-round distinguisher, 25-round integral attack on HIGHT was proposed based on the principle of time memory trade-off, with the data, time and memory complexity of 262.92, 266.20 and 2119 respectively. The results show that the attack was better than results before on the number of round and time complexity.
Keywords:cryptanalysis  bock cipher  integral attack  HIGHT block cipher
点击此处可从《通信学报》浏览原始摘要信息
点击此处可从《通信学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号