Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Information Processing

Quantum zero correlation linear cryptanalysis

Rui Shi, Huiqin Xie, Huamin Feng, Feng Yuan, Biao Liu

Published Aug 13, 2022• 8 citations
Publisher
DOI
10.1007/s11128-022-03642-2

Related papers

Quantum linear cryptanalysis on a toy cipher

Ashwini Kumar Malviya, Namita Tiwari

Pramana•Apr 6, 2023•2 citations

Quantum cryptanalysis

Kahrobaei, Delaram, Flores, Ramón, Marialaura Noce +2 more

Mathematical surveys and monographs•Jan 1, 2024•0 citations

Quantum differential cryptanalysis

Д. Денисенко

Journal of Computer Virology and Hacking Techniques•Sep 3, 2021•8 citations

Quantum Cryptanalysis: A Comparative Study

Evangelos Mavridis

•Sep 8, 2026•0 citations

Quantum Cryptanalysis of AES

Xavier Bonnetain, María Naya‐Plasencia, André Schrottenloher

•Oct 8, 2018•0 citations

Finding Zero Correlation Linear Hulls Using Quantum Bernstein-vazirani Algorithm

Huiqin Xie, Zhangmei Zhao

Abstract Facing the threat of quantum computing to cryptography schemes, it is urgent to study the applications of quantum algorithms to cryptanalysis and evaluate the security of cryptographic schemes in a quantum computing environment. To do this, it is necessary to analyze the ability of cryptanalysis methods, such as integral and linear attacks, when combined with quantum algorithms. In this article, we investigate the properties of block ciphers with SPN structure and their security against a quantum adversary and apply the Bernstein-Vazirani algorithm to zero correlation linear attacks. Based on the relation between linear approximates of SPN ciphers and the dual cipher’s linear structures, we proposed a quantum algorithm that can find linear hulls with zero correlation of SPN ciphers. We show the validity of the proposed quantum algorithm and estimate the corresponding computational complexity. Implementing our quantum algorithm only costs polynomial qubits and quantum gates.

Journal of Physics Conference Series•Oct 1, 2024•0 citations
Abstract Facing the threat of quantum computing to cryptography schemes, it is urgent to study the applications of quantum algorithms to cryptanalysis and evaluate the security of cryptographic schemes in a quantum computing environment. To do this, it is necessary to analyze the ability of cryptanalysis methods, such as integral and linear attacks, when combined with quantum algorithms. In this article, we investigate the properties of block ciphers with SPN structure and their security against a quantum adversary and apply the Bernstein-Vazirani algorithm to zero correlation linear attacks. Based on the relation between linear approximates of SPN ciphers and the dual cipher’s linear structures, we proposed a quantum algorithm that can find linear hulls with zero correlation of SPN ciphers. We show the validity of the proposed quantum algorithm and estimate the corresponding computational complexity. Implementing our quantum algorithm only costs polynomial qubits and quantum gates.