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

刘正斌

doi:10.11959/j.issn.2096-109x.2016.00050

您当前的位置：

首页 >

文章列表页 >

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

学术论文 | 更新时间：2024-06-03

- 自动化搜索ARX密码差分特征的方法
- Automatic search algorithm for differential characteristics in ARX ciphers
- 网络与信息安全学报 2016年2卷第5期页码：56-63
- 作者机构：
  
  1. 中国科学院信息工程研究所信息安全国家重点实验室，北京 100093
  2. 中国科学院大学，北京 100049
- 作者简介：
  
  [ "刘正斌（1985-），男，山东青岛人，中国科学院信息工程研究所博士生，主要研究方向为密码学。" ]
- 基金信息：
  
  国家自然科学基金资助项目;The National Natural Science Foundation of China(61379142);国家重点基础研究发展计划（“973”计划）基金资助项目;The National Basic Research Program of China (973 Program)(2013CB834203)
- DOI：10.11959/j.issn.2096-109x.2016.00050
  中图分类号： TP393
- 网络首发：2016-05，
  
  纸质出版：2016-05-15
- 稿件说明：
移动端阅览
刘正斌. 自动化搜索ARX密码差分特征的方法[J]. 网络与信息安全学报, 2016,2(5):56-63.

Zheng-bin LIU. Automatic search algorithm for differential characteristics in ARX ciphers[J]. Chinese Journal of Network and Information Security, 2016, 2(5): 56-63.
刘正斌. 自动化搜索ARX密码差分特征的方法[J]. 网络与信息安全学报, 2016,2(5):56-63. DOI： 10.11959/j.issn.2096-109x.2016.00050.

Zheng-bin LIU. Automatic search algorithm for differential characteristics in ARX ciphers[J]. Chinese Journal of Network and Information Security, 2016, 2(5): 56-63. DOI： 10.11959/j.issn.2096-109x.2016.00050.

摘要

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

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.

关键词

Keywords

references

SHIMIZU A , MIYAGUCHI S . Fast data encipherment algorithm FEAL [C ] // International Conference on Theory and Application of Cryptographic Techniques . c1987 : 267 - 278 .

WHEELER D J , NEEDHAM R M . Tea,a tiny encryption algorithm [M ] // Fast Software Encryption . Berlin:Springer , 2015 : 363 - 366 .

RIVEST R L , . The RC5 encryption algorithm [C ] // Fast Software Encryption:Second International Workshop . c1994 : 14 - 16 .

HONG D , SUNG J , HONG S , et al . HIGHT:a new block cipher suitable for low-resource device [M ] // Cryptographic Hardware and Embedded Systems-CHES 2006 . Berlin:Springer , 2006 : 46 - 59 .

BEAULIEU R , SHORS D , SMITH J , et al . The SIMON and SPECK families of lightweight block ciphers [R ] . IACR Cryptology ePrint Archive , 2013 .

BERNSTEIN D J . The salsa20 family of stream ciphers [R ] . New Stream Cipher Designs-The eSTREAM Finalists , 2008 .

RIVEST R L , . The MD4 message digest algorithm [C ] // CRYPTO . c1990 : 303 - 311 .

FERGUSON N , LUCKS S , SCHNEIER B , et al . The skein hashfunction family [R ] . Submission to NIST(Round 3) , 2010 .

AUMASSON J P , HENZEN L , MEIER W , et al . Sha-3 proposal blake [R ] . Submission to NIST(Round 3) , 2010 .

BIHAM E , SHAMIR A . Differential cryptanalysis of des-like cryptosystems [J ] . Journal of Cryptology , 1991 , 1 ( 4 ): 3 - 72 .

AOKI K , KOBAYASHI K , MORIAI S . Best differential characteristic search of FEAL [M ] // Fast Software Encryption . Berlin :Springer , 1997 : 41 - 53 .

BANNIER A , BODIN N , FILIOL E . Automatic search for a maximum probability differential characteristic in a substitution-permutation network [C ] // International Conference on System Sciences,IEEE Computer Society . c2015 : 5165 - 5174 .

BIRYUKOV A , NIKOLIC I . Automatic search for related-key differential characteristics in byte-oriented block ciphers :application to AES,camellia,khazad and others [C ] // International Conference on the Theory and Applications of Cryptographic Techniques . c2010 : 322 - 344 .

BIRYUKOV A , NIKOLIC I . Search for related-key differential characteristics in des-like ciphers [C ] // International Conference on FAST Software Encryption . c2011 : 18 - 34 .

BOUILLAGUET C , DERBEZ P , FOUQUE P . Automatic search of attacks on round-reduced AES and applications [R ] . IACR Cryptology ePrint Archive , 2012 .

MATSUI M , . On correlation between the order of s-boxes and the strength of DES [M ] // Advances in Cryptology—EUROCRYPT'94 . Berlin:Springer , 1994 : 366 - 375 .

MOUHA N , WANG Q , GU D , et al . Differential and linear cryptanalysis using mixed-integer linear programming [C ] // 7th International Conference on Information Security and Cryptology . c2011 .

SUN S W , HU L , WANG P , et al . Automatic security evaluation and (related-key) differential characteristic search:application to simon,present,lblock,DES(L) and other bit-oriented block ciphers [C ] // The 20th International Conference on the Theory and Application of Cryptology and Information Security . c2014 .

BIRYUKOV A , VELICHKOV V . Automatic search for differential trails in ARX ciphers [M ] // Topics in Cryptology–CT-RSA 2014 . Berlin:Springer , 2014 : 227 - 250 .

BIRYUKOV A , ROY A , VELICHKOV V . Differential analysis of block ciphers SIMON and SPECK [M ] // Fast Software Encryption . Berlin:Springer Heidelberg , 2014 : 546 - 570 .

FU K , WANG M Q , GUO Y , et al . MILP-based automatic search algorithms for differential and linear trails for speck [C ] // Fast Software Encryption,23rd International Workshop . c2016 .

浏览量

149

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

改进的Joltik-BC-128算法的中间相遇攻击

基于SAT方法进一步加速差分特征的搜索

LowMC实例的差分枚举攻击效果分析

基于密码结构的扩散层构造

MDS矩阵构造方法