减轮SPECK算法的不可能差分分析

徐洪; 苏鹏晖; 戚文峰

doi:10.11999/JEIT170049

减轮SPECK算法的不可能差分分析

doi: 10.11999/JEIT170049

基金项目:

国家自然科学基金(61100200, 61309017, 61472251, 61502524, 61521003)

计量
- 文章访问数: 1947
- HTML全文浏览量: 240
- PDF下载量: 381
- 被引次数: 0
出版历程
- 收稿日期: 2017-01-16
- 修回日期: 2017-05-15
- 刊出日期: 2017-10-19

Impossible Differential Cryptanalysis of Reduced-round SPECK

Funds:

The National Natural Science Foundation of China (61100200, 61309017, 61472251, 61502524, 61521003)

摘要

摘要: SPECK系列算法是2013年由美国国家安全局提出的轻量分组密码算法。算法整体为变形的Feistel结构，轮函数为模整数加法、循环移位和异或的组合，即所谓的ARX模块。在不可能差分研究方面，目前仅有LEE等人给出了SPECK 64算法的一些6轮不可能差分特征。该文进一步找到了SPECK 32/64算法和SPECK 48/96算法的一些6轮不可能差分特征，并在其前面添加1轮后面添加3轮，给出了对两个算法的10轮不可能差分分析。
- 轻量分组密码算法 /
- SPECK算法 /
- 不可能差分分析 /
- 不可能差分特征
Abstract: SPECK is a family of lightweight block ciphers proposed in 2013 by researches from National Security Agency (NSA) of USA. The algorithm adopts a modified Feistel construction that applies a combination of addition, rotation and XORing (the so-called ARX structure). Up to now, nothing is done on the impossible differential cryptanalysis of the SPECK family except that some 6-round impossible differential characteristics are found by LEE et al. In this article, some 6-round impossible differential characteristics of SPECK 32/64 and SPECK 48/96 are found and a 10-round impossible differential cryptanalysis on these two ciphers is presented by adding one round forward and three rounds backward.
- Lightweight block ciphers /
- SPECK cipher /
- Impossible differential cryptanalysis /
- Impossible differential characteristic

HTML全文

参考文献(16)

KNUDSEN L. DEALA 128-bit block cipher[R]. Department of Informatics, University of Bergen, Norway, 1998.

BIHAM E, BIRYUKOV A, and SHAMIR A. Cryptanalysis of skipjack reduced to 31 rounds using impossible differentials [J]. Lecture Notes in Computer Science, 1999, 1592: 12-23. doi: 10.1007/3-540-48910-X_2.

LU J, KELLER N, and KIM J. New impossible differential attacks on AES[J]. Lecture Notes in Computer Science, 2008, 5365: 279-293. doi: 10.1007/978-3-540-89754-5_22.

ZHANG Wentao, WU Wenling, and FENG Dengguo. New results on impossible differential cryptanalysis of reduced AES[J]. Lecture Notes in Computer Science, 2007, 4817: 239-250. doi: 10.1007/978-3-540-76788-6_19.

LU J, KIM J, and KELLER N. Improving the efficiency of impossible differential cryptanalysis of reduced Camellia and MISTY1[J]. Lecture Notes in Computer Science, 2008, 4964: 370-386. doi: 10.1007/978-3-540-79263-5_24.

WU Wenling, ZHANG Wentao, and FENG Dengguo.

Impossible differential cryptanalysis of reduced-round ARIA and Camellia[J]. Journal of Computer Science and Technology, 2007, 22(3): 449-456. doi: 10.1007/s11390-007-9056-0.

ABED F, LIST E, and LUCKS S. Differential cryptanalysis of round-reduced SIMON and SPECK[J]. Lecture Notes in Computer Science, 2014, 8540: 525-545. doi: 10.1007/978-3- 662-46706-0_27.

BIRYUKOV A, ROY A, and VELICHKOV V. Differential analysis of block ciphers SIMON and SPECK[J]. Lecture Notes in Computer Science, 2014, 8540: 546-570. doi: 10.1007 /978-3-662-46706-0_28.

DINUR I. Improved differential cryptanalysis of round- reduced SPECK[J]. Lecture Notes in Computer Science, 2014, 8781: 147-164. doi: 10.1007/978-3-319-13051-4_9.

BIRYUKOV A, VELICHKOV V, and LE Y. Automatic

search for the best trails in ARX: Application to Block Cipher SPECK[J]. Lecture Notes in Computer Science, 2016, 9783: 289-310. doi: 10.1007/978-3-662-52993-5_15.

FU Kai, WANG Meiqin, and GUO Y. MILP-based automatic search algorithms for differential and linear trails for SPECK [J]. Lecture Notes in Computer Science, 2016, 9783: 268-288. doi: 10.1007/978-3-662-52993-5_14.

YAO Yuan, ZHANG Bin, and WU Wenling. Automatic search for linear trails of the SPECK family[J]. Lecture Notes in Computer Science, 2015, 9290: 158-176. doi: 10.1007/ 978-3-319-23318-5_9.

程雨芊. 对SPECK系列分组密码算法的零相关线性分析 [D]. [硕士论文], 山东大学, 2015.

CHENG Yuqian. Zero correlation cryptanalysis of block cipher speck[D]. [Master dissertation], Shandong University, 2015.

施引文献

资源附件(0)

访问统计