Quantum Differential Meet-In-The-Middle Attack and Some Applications to Lightweight Ciphers

被引:2
作者
Xu, Yin-Song [1 ]
Cai, Bin-Bin [2 ]
Yuan, Zheng [3 ]
Qin, Su-Juan [1 ]
Gao, Fei [1 ]
Wen, Qiao-Yan [1 ]
机构
[1] Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing 100876, Peoples R China
[2] Fujian Normal Univ, Coll Comp & Cyber Secur, Fuzhou 350117, Peoples R China
[3] Beijing Elect Sci & Technol Inst, Beijing 100070, Peoples R China
基金
中国国家自然科学基金;
关键词
differential attack; lightweight block cipher; meet-in-the-middle attack; nested quantum search; quantum resource; BLOCK CIPHERS; SIMON;
D O I
10.1002/qute.202400157
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
At CRYPTO 2023, Boura et al. proposed a new cryptanalysis technique, differential meet-in-the-middle (MITM) attack. They used MITM technique to make the key recovery step of a differential attack more efficient. In this study, a quantum differential meet-in-the-middle attack is proposed by using nested quantum search algorithm, which can achieve up to a quadratic speed-up compared to the classical version. Besides, the time complexity of the attack can be reduced by at least a factor of 2(kin boolean OR kout-n)/2${2<^>{({\left| {{k_{in}} \cup {k_{out}}} \right| } - n)/2}}$ (kin boolean OR kout${{\left| {{k_{in}} \cup {k_{out}}} \right| }}$ is the guessed key length and n$n$ is the block size) compared to the first quantum differential attack proposed by Kaplan et al. at ToSC 2016. Finally, to demonstrate the efficiency of our attack, it is applied to two reduced-round lightweight block ciphers, PIPO and SIMON, to evaluate their post-quantum security. When attacking the same number of rounds, the time complexity of our attack is significantly lower than that of classical attacks. For the 8-round PIPO-128, the attack significantly improves efficiency, reducing the time complexity from 264+260.94$2<^>{64} + 2<^>{60.94}$ to 260.48$2<^>{60.48}$, cutting down the required qRAM size by a factor of 214$2<^>{14}$ and obtaining the data complexity 257$2<^>{57}$ instead of 264$2<^>{64}$ compared to the best quantum attack proposed by Schrottenloher at CRYPTO 2023. For the 19-round SIMON-32-64, the time complexity here will be 231.68$2<^>{31.68}$ instead of 233.39$2<^>{33.39}$ compared to the other quantum attack, and the attack can target more rounds than using Grover-meets-Simon technique. The development of quantum computing drives a shift in cryptanalysis. Many quantum cryptanalysis techniques are proposed. This study proposes a new quantum cryptanalysis technique, quantum differential meet-in-the-middle (QDMITM) attack, which is based on nested quantum search algorithm. And its quantum circuit is shown in the cover graphic. image
引用
收藏
页数:14
相关论文
共 56 条
[51]   A quantum federated learning framework for classical clients [J].
Song, Yanqi ;
Wu, Yusen ;
Wu, Shengyao ;
Li, Dandan ;
Wen, Qiaoyan ;
Qin, Sujuan ;
Gao, Fei .
SCIENCE CHINA-PHYSICS MECHANICS & ASTRONOMY, 2024, 67 (05)
[52]   Quantum Attacks on Type-1 Generalized Feistel Schemes [J].
Sun, Hong-Wei ;
Cai, Bin-Bin ;
Qin, Su-Juan ;
Wen, Qiao-Yan ;
Gao, Fei .
ADVANCED QUANTUM TECHNOLOGIES, 2023, 6 (10)
[53]   Claw finding algorithms using quantum walk [J].
Tani, Seiichiro .
THEORETICAL COMPUTER SCIENCE, 2009, 410 (50) :5285-5297
[54]  
Wagner D, 1999, LECT NOTES COMPUT SC, V1636, P156
[55]   Quantum forgery attacks on COPA, AES-COPA and marble authenticated encryption algorithms [J].
Xu, Yinsong ;
Liu, Wenjie ;
Yu, Wenbin .
QUANTUM INFORMATION PROCESSING, 2021, 20 (04)
[56]   Modeling Large S-box in MILP and a (Related-Key) Differential Attack on Full Round PIPO-64/128 [J].
Yadav, Tarun ;
Kumar, Manoj .
SECURITY, PRIVACY, AND APPLIED CRYPTOGRAPHY ENGINEERING, SPACE 2022, 2022, 13783 :3-27