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 key recovery under plaintext-checking attacks on post-quantum cryptosystems

Yaru Wang, Haodong Jiang, Zhi Ma

Published Dec 30, 2024• 2 citations
Publisher
DOI
10.1007/s11128-024-04629-x

Related papers

Quantum Key Recovery Attack on Post-Quantum Cryptosystems

Y.C. Wang, Jianmei Liu

IEEE Internet of Things Journal•Apr 23, 2026•0 citations

Quantum Misuse Attack on Frodo

Yaru Wang, Haodong Jiang, Zhi Ma

Research on the security of lattice-based public-key encryption schemes against misuse attacks is an important part of the cryptographic assessment of the National Institute of Standards and Technology (NIST) post-quantum cryptography (PQC) standardization process. In particular, many NIST-PQC cryptosystems follow the same meta-cryptosystem. At EUROCRYPT 2019, Ba˘etu et al. mounted a classical key recovery under plaintext checking attacks (KR-PCA) and a quantum key recovery under chosen ciphertext attacks (KR-CCA). They analyzed the security of the weak version of nine submissions to NIST. In this paper, we focus on learning with error (LWE)-based FrodoPKE, whose IND-CPA security is tightly related to the hardness of plain LWE problems. We first review the meta-cryptosystem and quantum algorithm for solving quantum LWE problems. Then, we consider the case where the noise follows a discrete Gaussian distribution and recompute the success probability for quantum LWE by using Hoeffding bound. Finally, we give a quantum key recovery algorithm based on LWE under CCA attack and analyze the security of Frodo. Compared with the existing work of Ba˘etu et al., our method reduces the number of queries from 22 to 1 with the same success probability.

Entropy•Oct 4, 2022•5 citations

Cryptoanalysis on the optical image cryptosystem based on interference and unequal modulus decomposition

Jiashuai Liu, H. Xu, Yi Xiong

This paper offers a security analysis of an optical image cryptosystem that integrates interference and unequal modulus decomposition (EMD). In contrast to the conventional interference-based cryptosystem, which utilizes a single phase-only mask (POM) derived from the encryption process as the private key, the enhanced cryptosystem employs two random phase masks (RPMs) and two POMs derived from the phase-reserved (PR) structure as private keys. This modification addresses the silhouette problem inherent in the conventional interference-based cryptosystem by expanding the key space, thereby enhancing security strength. However, it is determined that the RPM R 2 ( u , v ) and the POM P 2 ( x , y ) exhibited low key sensitivity, thereby limiting their impact on the security enhancement. Additionally, due to the independence from the plaintext, the RPMs employed as private keys can be recovered using a designed known-plaintext attack (KPA). Once the RPMs are recovered, the number of unknown keys is reduced to two. This enables the recovery of plaintext information from its ciphertexts via a subsequent ciphertext-only attack (COA) without any prior knowledge of the POMs. In light of these findings, a novel hybrid attack strategy, to our knowledge, is proposed, integrating four cascaded KPAs and a COA, to effectively compromise the advanced interference and EMD-based cryptosystem. To validate the feasibility and effectiveness of the proposed hybrid attack, numerical simulations have been conducted.

Applied Optics•Jan 9, 2026•2 citations

Misuse Attacks on Post-quantum Cryptosystems

Ciprian Băetu, F. Betül Durak, Loïs Huguenin-Dumittan +2 more

Lecture notes in computer science•Jan 1, 2019•48 citations

Quantum Attacks on Public-Key Cryptosystems

Song Yuan Yan

Springer eBooks•Jan 1, 2013•64 citations

Efficient Quantum Generic Key-Recovery Attack on Feistel Ciphers

Kun Zhang, Tao Shang, Yuanjing Zhang

The development of post-quantum cryptography requires cryptographic primitives that remain secure against quantum adversaries. Quantum key-recovery attacks constitute a fundamental class of quantum cryptanalytic techniques, and the resistance of a cryptosystem to such attacks serves as an important indicator of its overall security. Since the Feistel structure is a core component in the design of many block ciphers, efficient quantum key-recovery attacks on Feistel ciphers provide valuable insights into evaluating and strengthening their security. In this paper, we propose an efficient generic quantum key-recovery attack on Feistel ciphers. Our attack integrates universal hash families with Simon's and Grover's algorithms to perform key-recovery. We rigorously analyze the correctness of the proposed attack and derive its time and quantum resource complexities. A comprehensive comparison with existing keyrecovery attacks shows that the proposed approach improves both quantum resource usage and dominant query complexity, and therefore yields a more efficient quantum key-recovery attack. Our work enhances the understanding of Feistel ciphers under quantum threats and informs the design of robust cryptosystems for the post-quantum era.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Apr 6, 2026•0 citations
Research on the security of lattice-based public-key encryption schemes against misuse attacks is an important part of the cryptographic assessment of the National Institute of Standards and Technology (NIST) post-quantum cryptography (PQC) standardization process. In particular, many NIST-PQC cryptosystems follow the same meta-cryptosystem. At EUROCRYPT 2019, Ba˘etu et al. mounted a classical key recovery under plaintext checking attacks (KR-PCA) and a quantum key recovery under chosen ciphertext attacks (KR-CCA). They analyzed the security of the weak version of nine submissions to NIST. In this paper, we focus on learning with error (LWE)-based FrodoPKE, whose IND-CPA security is tightly related to the hardness of plain LWE problems. We first review the meta-cryptosystem and quantum algorithm for solving quantum LWE problems. Then, we consider the case where the noise follows a discrete Gaussian distribution and recompute the success probability for quantum LWE by using Hoeffding bound. Finally, we give a quantum key recovery algorithm based on LWE under CCA attack and analyze the security of Frodo. Compared with the existing work of Ba˘etu et al., our method reduces the number of queries from 22 to 1 with the same success probability.
This paper offers a security analysis of an optical image cryptosystem that integrates interference and unequal modulus decomposition (EMD). In contrast to the conventional interference-based cryptosystem, which utilizes a single phase-only mask (POM) derived from the encryption process as the private key, the enhanced cryptosystem employs two random phase masks (RPMs) and two POMs derived from the phase-reserved (PR) structure as private keys. This modification addresses the silhouette problem inherent in the conventional interference-based cryptosystem by expanding the key space, thereby enhancing security strength. However, it is determined that the RPM R 2 ( u , v ) and the POM P 2 ( x , y ) exhibited low key sensitivity, thereby limiting their impact on the security enhancement. Additionally, due to the independence from the plaintext, the RPMs employed as private keys can be recovered using a designed known-plaintext attack (KPA). Once the RPMs are recovered, the number of unknown keys is reduced to two. This enables the recovery of plaintext information from its ciphertexts via a subsequent ciphertext-only attack (COA) without any prior knowledge of the POMs. In light of these findings, a novel hybrid attack strategy, to our knowledge, is proposed, integrating four cascaded KPAs and a COA, to effectively compromise the advanced interference and EMD-based cryptosystem. To validate the feasibility and effectiveness of the proposed hybrid attack, numerical simulations have been conducted.
The development of post-quantum cryptography requires cryptographic primitives that remain secure against quantum adversaries. Quantum key-recovery attacks constitute a fundamental class of quantum cryptanalytic techniques, and the resistance of a cryptosystem to such attacks serves as an important indicator of its overall security. Since the Feistel structure is a core component in the design of many block ciphers, efficient quantum key-recovery attacks on Feistel ciphers provide valuable insights into evaluating and strengthening their security. In this paper, we propose an efficient generic quantum key-recovery attack on Feistel ciphers. Our attack integrates universal hash families with Simon's and Grover's algorithms to perform key-recovery. We rigorously analyze the correctness of the proposed attack and derive its time and quantum resource complexities. A comprehensive comparison with existing keyrecovery attacks shows that the proposed approach improves both quantum resource usage and dominant query complexity, and therefore yields a more efficient quantum key-recovery attack. Our work enhances the understanding of Feistel ciphers under quantum threats and informs the design of robust cryptosystems for the post-quantum era.