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

FOX算法的中间相遇攻击
引用本文:李荣佳,金晨辉.FOX算法的中间相遇攻击[J].通信学报,2016,37(8):185-190.
作者姓名:李荣佳  金晨辉
作者单位:解放军信息工程大学三院,河南 郑州 450002
基金项目:国家自然科学基金资助项目(No.61272488, No.61402523)
摘    要:研究了FOX分组密码算法在中间相遇攻击下的安全性。首先,分别构造了FOX64和FOX128的3轮中间相遇区分器,实施了6轮中间相遇攻击,得到对6轮FOX64和FOX128较好的攻击结果。其次,将FOX128的中间相遇区分器扩展到4轮,并结合时间存储数据折衷的方法,攻击了7轮FOX128,与已有的攻击结果相比,攻击的时间复杂度和存储复杂度略大,而数据复杂度明显降低。

关 键 词:分组密码  密码分析  中间相遇攻击  FOX算法

Meet-in-the-middle attacks on FOX block cipher
IRong-jia L,INChen-hui J.Meet-in-the-middle attacks on FOX block cipher[J].Journal on Communications,2016,37(8):185-190.
Authors:IRong-jia L  INChen-hui J
Affiliation:The Third College,PLA Information Engineering University,Zhengzhou 450002,China
Abstract:The security of the block cipher FOX against meet-in-the-middle attack was analyzed. Firstly, 3-round meet-in-the-middle distinguishers was constructed and 6-round meet-in-the-middle attacks for FOX64 and FOX128 was proposed. The two attacks were beter attacks for 6-round FOX64 and FOX128, respectively. Secondly, the meet-in-the-middle distinguisher was extended of FOX128 to 4 rounds and proposed 7-round meet-in-the-middle attack combined with time/memory/data tradeoff. Compared to the currently known attacks on 7-round FOX128, The attack has a greater time and memory complexity, however the data complexity is much smaller.
Keywords:block cipher  cryptanalysis  meet-in-the-middle attack  FOX
点击此处可从《通信学报》浏览原始摘要信息
点击此处可从《通信学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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