TY - GEN
T1 - Full-Phase Distributed Quantum Impossible Differential Cryptanalysis
AU - Zhang, Kun
AU - Shang, Tao
AU - Zhang, Yuanjing
AU - Liu, Jianwei
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2026.
PY - 2026
Y1 - 2026
N2 - The continuous development of quantum computing technology has brought potential threats to the traditional cryptographic system, which has attracted the attention of the cryptographic community. As quantum computing enters the noisy intermediate-scale quantum era, quantum computing models are constrained by quantum resources and circuit noise. It is necessary to evaluate the security of cryptographic primitives accurately, combined with the development status of quantum computing. In this paper, we propose a full-phase distributed quantum impossible differential cryptanalysis by combining the Bernstein-Vazirani algorithm, quantum phase estimation algorithm, and quantum counting algorithm with the miss-in-the-middle technique. We rigorously analyze the correctness and complexity of the proposed cryptanalysis and design the corresponding distributed quantum circuits. Compared with the classical impossible cryptanalysis, our cryptanalysis avoids the influence of the number of encryption rounds on the cryptanalysis results and has lower complexity. Compared with the existing quantum differential cryptanalysis, the proposed cryptanalysis has lower complexity, shallower circuit depth, and stronger robustness to circuit noise.
AB - The continuous development of quantum computing technology has brought potential threats to the traditional cryptographic system, which has attracted the attention of the cryptographic community. As quantum computing enters the noisy intermediate-scale quantum era, quantum computing models are constrained by quantum resources and circuit noise. It is necessary to evaluate the security of cryptographic primitives accurately, combined with the development status of quantum computing. In this paper, we propose a full-phase distributed quantum impossible differential cryptanalysis by combining the Bernstein-Vazirani algorithm, quantum phase estimation algorithm, and quantum counting algorithm with the miss-in-the-middle technique. We rigorously analyze the correctness and complexity of the proposed cryptanalysis and design the corresponding distributed quantum circuits. Compared with the classical impossible cryptanalysis, our cryptanalysis avoids the influence of the number of encryption rounds on the cryptanalysis results and has lower complexity. Compared with the existing quantum differential cryptanalysis, the proposed cryptanalysis has lower complexity, shallower circuit depth, and stronger robustness to circuit noise.
KW - Block cipher
KW - Quantum algorithm
KW - Quantum cryptanalysis
KW - Symmetric cryptography
UR - https://www.scopus.com/pages/publications/105022109699
U2 - 10.1007/978-981-95-3537-8_3
DO - 10.1007/978-981-95-3537-8_3
M3 - 会议稿件
AN - SCOPUS:105022109699
SN - 9789819535361
T3 - Lecture Notes in Computer Science
SP - 41
EP - 56
BT - Information and Communications Security - 27th International Conference, ICICS 2025, Proceedings
A2 - Han, Jinguang
A2 - Cheng, Guang
A2 - Chen, Liquan
A2 - Xiang, Yang
A2 - Susilo, Willy
PB - Springer Science and Business Media Deutschland GmbH
T2 - 27th International Conference on Information and Communications Security, ICICS 2025
Y2 - 29 October 2025 through 31 October 2025
ER -