• 安全技术 •

Khudra算法的相关密钥差分分析

1. (山东师范大学 信息科学与工程学院,济南 250014)
• 收稿日期:2016-11-02 出版日期:2017-11-15 发布日期:2017-11-15
• 作者简介:任瑶瑶(1992—),女,硕士研究生,主研方向为密码分析;张文英(通信作者),教授、博士后、博士生导师;邢朝辉,博士研究生。
• 基金项目:
国家自然科学基金(61272434,61672330,61602287);山东省自然科学基金(ZR2013FQ021)。

Related-key Differential Analysis of Khudra Algorithm

REN Yaoyao,ZHANG Wenying,XING Chaohui

1. (College of Information Science and Engineering,Shandong Normal University,Jinan 250014,China)
• Received:2016-11-02 Online:2017-11-15 Published:2017-11-15

Khudra算法是一种总轮数为18的轻量级分组密码算法。现有分析方法使用相关密钥差分分析Khudra算法,通过在2个密钥上引入差分,构造14轮区分器攻击16轮Khudra算法,区分器的攻击概率为2－56.85。基于此,同样使用相关密钥差分分析Khudra算法,仅在1个密钥上引入差分构造10轮区分器,共攻击16轮Khudra算法。分析结果表明,该10轮区分器与现有相关密钥差分分析的14轮区分器相比攻击概率提高了2 28.425,整个分析过程的数据复杂度为2 33,时间复杂度为2 95

Abstract:

Khudra algorithm is a kind of lightweight block cipher algorithm which has 18 rounds.The existing analysis method,which uses the impossibility relevant key difference to analysis Khudra algorithm,constructs a 14 rounds distinguisher to attack the 16 round Khudra algorithm by introducing a difference on two keys.The successful attack probability of the distinguisher is 2－56.85.In this paper,it constructs 10 rounds distinguisher,by making difference on one key,to attack Khudrain total 16 rounds based on the relevant key difference.Analysis results show that the successful probability of the 10 rounds distinguisher improvs 2 28.425 compared with the previous 14 rounds distinguisher,data complexity of the whole analysis process is 2 33,and time complexity is 2 95.