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

CLEFIA密码的Square攻击
引用本文:唐学海,李超,谢端强.CLEFIA密码的Square攻击[J].电子与信息学报,2009,31(9):2260-2263.
作者姓名:唐学海  李超  谢端强
作者单位:1. 国防科技大学数学与系统科学系,长沙,410073
2. 国防科技大学数学与系统科学系,长沙,410073;东南大学移动通信国家重点实验室,南京,210096
基金项目:国家自然科学基金,东南大学移动通信国家重点实验室开放基金(w200805)资助课题 
摘    要:该文根据CLEFIA密码的结构特性,得到了Square攻击的新的8轮区分器,并指出了设计者提出的错误8轮区分器。利用新的8轮区分器对CLEFIA密码进行了10到12轮的Square攻击,攻击结果如下:攻击10轮CLEFIA-128\192\256的数据复杂度和时间复杂度分别为297和292.7;攻击11轮CLEFIA-192\256的数据复杂度和时间复杂度分别为298和2157.6;攻击12轮CLEFIA-256的数据复杂度和时间复杂度分别为298.6和2222。攻击结果表明:在攻击10轮CLEFIA时,新的Square攻击在数据复杂度和时间复杂度都优于设计者给出的Square攻击。

关 键 词:密码    CLEFIA    区分器    Square攻击
收稿时间:2008-9-19
修稿时间:2009-4-28

Square Bttack on CLEFIA
Tang Xue-hai Li Chao Xie Duan-qiang.Square Bttack on CLEFIA[J].Journal of Electronics & Information Technology,2009,31(9):2260-2263.
Authors:Tang Xue-hai Li Chao Xie Duan-qiang
Affiliation:Department of Mathematics and System Science, National University of Defense Technology, Changsha 410073, China; National Mobile Communications Research Laboratory, Southeast University, Nanjing 210096, China
Abstract:According to the structure properties of CLEFIA , new 8-round distinguishers for Square attack are presented, and the wrong 8-round distinguishers originally found by the designers are pointed out. Based on the new distinguisher, the square attack on CLEFIA can be improved as follows: 10-round CLEFIA-128\192\256 is attacked with data complexity 297 and time complexity 292.7, 11-round CLEFIA-192/256 is attacked with data complexity 298 and time complexity 2157.6, and 12-round CLEFIA-256 is breakable with data complexity 298.6 and time complexity 2222. These results demonstrate that under the case of 10-round CLEFIA, both data and time complexity of our attack are better than those given by the designers.
Keywords:Cryptograph  CLEFIA  Distinguisher  Square attack
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《电子与信息学报》浏览原始摘要信息
点击此处可从《电子与信息学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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