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

ESF算法的不可能差分密码分析
引用本文:陈玉磊,卫宏儒.ESF算法的不可能差分密码分析[J].计算机科学,2016,43(8):89-91, 99.
作者姓名:陈玉磊  卫宏儒
作者单位:北京科技大学数理学院 北京100083,北京科技大学数理学院 北京100083
基金项目:本文受2013年国家自然科学基金(61272476),内蒙古自治区科技创新引导奖励资金项目(2012)资助
摘    要:分析研究了分组密码算法ESF抵抗不可能差分的能力,使用8轮不可能差分路径,给出了相关攻击结果。基于一条8轮的不可能差分路径,根据轮密钥之间的关系,通过改变原有轮数扩展和密钥猜测的顺序,攻击了11轮的ESF,改善了关于11轮的ESF的不可能差分攻击的结果。计算结果表明:攻击11轮的ESF所需要的数据复杂度为O(253),时间复杂度为O(232),同时也说明了11轮的ESF对不可能差分是不免疫的。

关 键 词:分组密码  不可能差分  ESF  轮密钥
收稿时间:7/5/2015 12:00:00 AM
修稿时间:2015/9/10 0:00:00

Impossible Differential Cryptanalysis of ESF
CHEN Yu-lei and WEI Hong-ru.Impossible Differential Cryptanalysis of ESF[J].Computer Science,2016,43(8):89-91, 99.
Authors:CHEN Yu-lei and WEI Hong-ru
Affiliation:School of Mathematics and Physics,University of Science and Technology Beijing,Beijing 100083,China and School of Mathematics and Physics,University of Science and Technology Beijing,Beijing 100083,China
Abstract:This paper studied and analyzed the ability of the block cipher algorithm ESF resisting the impossible diffe-rence,a 8-round impossible differential routz was used and the related results were given.On the basis of the 8-round impossible differential route,according to the relationship of the round keys,by changing the original order of round number extension and key guessing,the paper attacked 11-round ESF,improving the result of the 11-round ESF impossible differential.Computing result shows that the attack of 11-round ESF needs O(253) chosen plaintext operations and O(232) encrypting computations.At the same time,it also shows that the 11-round ESF is not immune to the impossible difference.
Keywords:Block cipher  Impossible differential  ESF  Round key
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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