网络与信息安全学报 ›› 2016, Vol. 2 ›› Issue (5): 56-63.doi: 10.11959/j.issn.2096-109x.2016.00050

• 学术论文 • 上一篇    下一篇

自动化搜索ARX密码差分特征的方法

刘正斌1,2   

  1. 1 中国科学院信息工程研究所信息安全国家重点实验室,北京 100093
    2 中国科学院大学,北京 100049
  • 修回日期:2016-04-27 出版日期:2016-05-15 发布日期:2020-03-26
  • 作者简介:刘正斌(1985-),男,山东青岛人,中国科学院信息工程研究所博士生,主要研究方向为密码学。
  • 基金资助:
    国家自然科学基金资助项目(61379142);国家重点基础研究发展计划(“973”计划)基金资助项目(2013CB834203)

Automatic search algorithm for differential characteristics in ARX ciphers

Zheng-bin LIU1,2   

  1. 1 The State Key Lab of Information Security,Institute of Information Engineering,Chinese Academy of Sciences,Beijing 100093,China
    2 University of Chinese Academy of Sciences,Beijing 100049,China
  • Revised:2016-04-27 Online:2016-05-15 Published:2020-03-26
  • Supported by:
    The National Natural Science Foundation of China(61379142);The National Basic Research Program of China (973 Program)(2013CB834203)

摘要:

摘 要:要解决ARX密码算法差分特征的自动化搜索问题,夫键是要解决搜索过程中模加差分的快速计算。首先,提出了相夫差分分布表的概念,通过查找相夫差分分布表,可以有效地计算模加的差分以及差分概率;其次,利用相夫差分分布表,将Matsui算法扩展到ARX密码,提出了自动化搜索ARX密码差分特征的算法;最后,利用提出的搜索算法,搜索SPECK算法的差分特征,得到了SPECK32、SPECK48和SPECK64的最优差分特征。

关键词: 分组密码, ARX, 差分特征, 自动化搜索, SPECK

Abstract:

How to compute the differential of modular addition efficiently is critical to automatic search for differential characteristic in ARX ciphers.To solve this problem,firstly,the concept of collerated difference distribution table (CDDT) was proposed.By looking up the CDDT,it was very efficient to compute the differential probability of modular addition.Secondly,extending Matsui’s algorithm to ARX cihpers and using CDDT,an automatic search algorithm was proposed,and the algorithm could give the differential characteristic with highest probability in ARX ciphers.Finally,the proposed algorithm was applied to the ARX cipher SPECK,and got the best differential characteristics for SPECK32,SPECK48 and SPECK64.

Key words: block cipher, ARX, differential characteristic, automatic search, SPECK

中图分类号: 

No Suggested Reading articles found!