Automatic Demirci-Selcuk Meet-in-the-Middle Attack on SKINNY with Key-Bridging

被引：4

作者：

Chen, Qiu ^{[1
,2
,3
]}

Shi, Danping ^{[1
,2
,3
]}

Sun, Siwei ^{[1
,2
,3
]}

Hu, Lei ^{[1
,2
,3
]}

机构：

[1] Chinese Acad Sci, Inst Informat Engn, State Key Lab Informat Secur, Beijing, Peoples R China

[2] Chinese Acad Sci, Data Assurance & Commun Secur Res Ctr, Beijing, Peoples R China

[3] Univ Chinese Acad Sci, Sch Cyber Secur, Beijing, Peoples R China

来源：

INFORMATION AND COMMUNICATIONS SECURITY (ICICS 2019) | 2020年 / 11999卷

基金：

国家重点研发计划; 中国国家自然科学基金;

关键词：

Demirci-Selcuk meet-in-the-middle attack; Constraint programming; MILP; Key-bridging; SKINNY;

D O I：

10.1007/978-3-030-41579-2_14

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Demirci-Selcuk meet-in-the-middle (DS - MITM) attack is an effective and generic method for analyzing iterative block ciphers. It reaches the best results on attacking AES in the single-key model. In ASIACRYPT 2018, a tool for finding VS - MITM attack automatically based on general constraint programming was put forward, which can not only enumerate VS - MITM distinguishers, but also partly automate the key-recovery process. However, the constraint programming models generated by this tool do not consider the key-bridging technique, which has been shown to be effective in reducing the complexities of many cryptanalytic attacks. In this work, we build a general constraint model for SKINNY-128-384 (the same target as the ASIACRYPT 2018 paper) integrated with the key-bridging technique. As a result, the time complexity of the key recovery attack on SKINNY-128-384 is significantly reduced from 2(382)(.)(46) to 2(366)(.)(28).

引用

页码：233 / 247

页数：15

共 33 条

[21] Improved Single-Key Attacks on 9-Round AES-192/256
Li, Leibo
Jia, Keting
Wang, Xiaoyun
[J]. FAST SOFTWARE ENCRYPTION, FSE 2014, 2015, 8540 : 127 - 146
[22] Meet-in-the-Middle Technique for Truncated Differential and Its Applications to CLEFIA and Camellia
Li, Leibo
Jia, Keting
Wang, Xiaoyun
Dong, Xiaoyang
[J]. FAST SOFTWARE ENCRYPTION, FSE 2015, 2015, 9054 : 48 - 70
[23] Meet-in-the-middle attacks on 10-round AES-256
Li, Rongjia
Jin, Chenhui
[J]. DESIGNS CODES AND CRYPTOGRAPHY, 2016, 80 (03) : 459 - 471
[24] Automatic Search for Key-Bridging Technique: Applications to LBlock and TWINE
Lin, Li
Wu, Wenling
Zheng, Yafei
[J]. FAST SOFTWARE ENCRYPTION (FSE 2016), 2016, 9783 : 247 - 267
[25] New Impossible Differential Search Tool from Design and Cryptanalysis Aspects Revealing Structural Properties of Several Ciphers
Sasaki, Yu
Todo, Yosuke
[J]. ADVANCES IN CRYPTOLOGY - EUROCRYPT 2017, PT III, 2017, 10212 : 185 - 215
[26] Shi D., 2018, LNCS, V1273, P3, DOI [10.1007/978-3-030, DOI 10.1007/978-3-030]
[27] Correlation of Quadratic Boolean Functions: Cryptanalysis of All Versions of Full MORUS
Shi, Danping
Sun, Siwei
Sasaki, Yu
Li, Chaoyun
Hu, Lei
[J]. ADVANCES IN CRYPTOLOGY - CRYPTO 2019, PT II, 2019, 11693 : 180 - 209
[28] Sun SW, 2017, IACR T SYMMETRIC CRY, V2017, P281, DOI 10.13154/tosc.v2017.i1.281-306
[29] Sun SW, 2014, LECT NOTES COMPUT SC, V8873, P158, DOI 10.1007/978-3-662-45611-8_9
[30] Wang L, 2014, INT J BIOCHEM CELL B, V54, P1, DOI 10.1016/j.biocel.2014.06.008

← 1 2 3 4 →