作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2012, Vol. 38 ›› Issue (3): 141-144. doi: 10.3969/j.issn.1000-3428.2012.03.048

• 安全技术 • 上一篇    下一篇

CLEFIA-128算法的不可能差分密码分析

郑秀林1,2,连至助1,2,鲁艳蓉1,2,袁 征1   

  1. (1. 北京电子科技学院信息安全系,北京 100070;2. 西安电子科技大学通信工程学院,西安 710071)
  • 收稿日期:2011-08-16 出版日期:2012-02-05 发布日期:2012-02-05
  • 作者简介:郑秀林(1956-),男,教授,主研方向:对称密码学; 连至助、鲁艳蓉,硕士研究生;袁 征,副教授
  • 基金资助:
    国家自然科学基金资助项目(61070250);北京市自然科学基金资助项目(4102055)

Impossible Differential Cryptanalysis of CLEFIA-128 Algorithm

ZHENG Xiu-lin 1,2, LIAN Zhi-zhu 1,2, LU Yan-rong 1,2, YUAN-Zheng 1   

  1. (1. Department of Information Security, Beijing Electronic Science and Technology Institute, Beijing 100070, China; 2. School of Telecommunications Engineering, Xidian University, Xi’an 710071, China)
  • Received:2011-08-16 Online:2012-02-05 Published:2012-02-05

摘要: 研究13轮CLEFIA-128算法,在9轮不可能差分攻击的基础上,提出一种未使用白化密钥的不可能差分密码分析方法。猜测每个密钥,筛选满足轮函数中S盒输入输出差分对的数据对。利用轮密钥之间的关系减少密钥猜测量,并使用Early Abort技术降低计算复杂度。计算结果表明,该方法的数据复杂度和时间复杂度分别为2120和2125.5。

关键词: 分组密码, CLEFIA-128算法, 密码分析, 不可能差分密码分析, Early Abort技术

Abstract: This paper presents an impossible differential cryptanalysis of 13-round CLEFIA-128 no whitening key, which use the 9-round impossible differential. In the process of cryptanalysis, it guesses each key and filter the data pairs using the output and input differences of S-box. It utilizes the keys relations to reduce the number of guessed keys, and introduces the early abort technique to reduce the time complexity. Computing result shows that the complexity of the cryptanalysis is about 2120 data and 2125.5 encryptions

Key words: block cipher, CLEFIA-128 algorithm, cryptanalysis, impossible differential cryptanalysis, Early Abort

中图分类号: