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

Lecture notes in computer science

Hidden Shift Quantum Cryptanalysis and Implications

Xavier Bonnetain, María Naya‐Plasencia

Published Jan 1, 2018• 54 citations
Publisher
DOI
10.1007/978-3-030-03326-2_19

Related papers

Quantum Cryptanalysis of Hidden Linear Functions

Dan Boneh, Richard J. Lipton

Lecture notes in computer science•Jan 1, 1995•171 citations

Quantum cryptanalysis

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

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

Quantum-Resistant Cryptography and Its Implications for Blockchain and Cryptocurrency: A Comprehensive Mathematical Analysis

Tehzeeb Ali Gows Basha

Modern public key cryptosystems rely on two assumptions regarding computational difficulty: the integer factorization problem (RSA) and the discrete logarithm problem (elliptic curve cryptography).These problems have stood the test of time for four decades of cryptanalysis.Yet, their algebraic and periodic nature makes them vulnerable to quantum algorithms, most notably Shor's algorithm (1994).This paper presents a detailed comparison between classical and quantum-resistant cryptographic systems with an emphasis on lattice-based systems.The Learning With Errors (LWE) problem and its variants (Ring-LWE, Module-LWE) do not have the same periodicity that makes problems like integer factorization and discrete logarithms susceptible to quantum algorithms.Furthermore, LWE problems have reductions from worst-case lattice problems and have mathematical proofs of quantum resistance.Due to the vulnerability of ECDSA algorithms for cryptocurrencies, it is estimated that current cryptocurrencies will no longer be secure once quantum computer technology matures within the next 10-30 years, potentially compromising holdings estimated at between $260 billion and $390 billion as of August 2026.The implications of cryptanalysis on public key cryptography systems motivate mathematical recommendations regarding the security of current cryptosystems and the need for a shift to post-quantum cryptographic standards.

Oxford Journal of Student Scholarship•Aug 30, 2026•0 citations

Quantum Cryptanalysis: A Comparative Study

Evangelos Mavridis

•Sep 8, 2026•0 citations

Quantum Computing-Based Cryptanalysis

Jincheng Zhang

•Aug 31, 2026•0 citations

Non‐quantum cryptanalysis of the noisy version of Aaronson–Christiano's quantum money scheme

Marta Conde Pena, Raúl Durán Díaz, Jean‐Charles Faugère +2 more

At STOC 2012, Aaronson and Christiano proposed a noisy and a noiseless version of the first public‐key quantum money scheme endowed with a security proof. This paper addresses the so‐called noisy hidden subspaces problem , on which the noisy version of their scheme is based. The first contribution of this work is a non‐quantum cryptanalysis of the above‐mentioned noisy quantum money scheme extended to prime fields , with , that runs in randomised polynomial time. This finding is supported with experimental results showing that, in practice, the algorithm presented is efficient and succeeds with overwhelming probability. The second contribution is a non‐quantum randomised polynomial‐time cryptanalysis of the noisy quantum money scheme over succeeding with a certain probability for values of the noise lying within a certain range. This result disproves a conjecture made by Aaronson and Christiano about the non‐existence of an algorithm that solves the noisy hidden subspaces problem over and succeeds with such probability.

IET Information Security•Dec 4, 2018•19 citations
Modern public key cryptosystems rely on two assumptions regarding computational difficulty: the integer factorization problem (RSA) and the discrete logarithm problem (elliptic curve cryptography).These problems have stood the test of time for four decades of cryptanalysis.Yet, their algebraic and periodic nature makes them vulnerable to quantum algorithms, most notably Shor's algorithm (1994).This paper presents a detailed comparison between classical and quantum-resistant cryptographic systems with an emphasis on lattice-based systems.The Learning With Errors (LWE) problem and its variants (Ring-LWE, Module-LWE) do not have the same periodicity that makes problems like integer factorization and discrete logarithms susceptible to quantum algorithms.Furthermore, LWE problems have reductions from worst-case lattice problems and have mathematical proofs of quantum resistance.Due to the vulnerability of ECDSA algorithms for cryptocurrencies, it is estimated that current cryptocurrencies will no longer be secure once quantum computer technology matures within the next 10-30 years, potentially compromising holdings estimated at between $260 billion and $390 billion as of August 2026.The implications of cryptanalysis on public key cryptography systems motivate mathematical recommendations regarding the security of current cryptosystems and the need for a shift to post-quantum cryptographic standards.
At STOC 2012, Aaronson and Christiano proposed a noisy and a noiseless version of the first public‐key quantum money scheme endowed with a security proof. This paper addresses the so‐called noisy hidden subspaces problem , on which the noisy version of their scheme is based. The first contribution of this work is a non‐quantum cryptanalysis of the above‐mentioned noisy quantum money scheme extended to prime fields , with , that runs in randomised polynomial time. This finding is supported with experimental results showing that, in practice, the algorithm presented is efficient and succeeds with overwhelming probability. The second contribution is a non‐quantum randomised polynomial‐time cryptanalysis of the noisy quantum money scheme over succeeding with a certain probability for values of the noise lying within a certain range. This result disproves a conjecture made by Aaronson and Christiano about the non‐existence of an algorithm that solves the noisy hidden subspaces problem over and succeeds with such probability.