FOX算法的中间相遇攻击  

Meet-in-the-middle attacks on FOX block cipher

作　　者：李荣佳[1] 金晨辉[1] 

机构地区：[1]解放军信息工程大学三院,河南郑州450002

出　　处：《通信学报》2016年第8期185-190,共6页Journal on Communications

基　　金：国家自然科学基金资助项目(No.61272488;No.61402523)~~

摘　　要：研究了FOX分组密码算法在中间相遇攻击下的安全性。首先,分别构造了FOX64和FOX128的3轮中间相遇区分器,实施了6轮中间相遇攻击,得到对6轮FOX64和FOX128较好的攻击结果。其次,将FOX128的中间相遇区分器扩展到4轮,并结合时间存储数据折衷的方法,攻击了7轮FOX128,与已有的攻击结果相比,攻击的时间复杂度和存储复杂度略大,而数据复杂度明显降低。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.

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

分 类 号：TP918.1[自动化与计算机技术]