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

Algebraic Cryptanalysis of a Quantum Money Scheme The Noise-Free Case

Marta Conde Pena, Jean‐Charles Faugère, Ludovic Perret

Published Jan 1, 2015• 19 citations
Publisher
DOI
10.1007/978-3-662-46447-2_9

Related papers

Cryptanalysis of three quantum money schemes

Andriyan Bilyk, Javad Doliskani, Zhiyong Gong

arXiv:2205.10488•Quantum Information Processing•Apr 19, 2023•12 citations

Quantum cryptanalysis on some generalized Feistel schemes

Xiaoyang Dong, Zheng Li, Xiaoyun Wang

Science China Information Sciences•Jan 2, 2019•80 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

New Constructions for Quantum Money and Its Application

Kefan Cheng, Hongfeng Zhu

International Journal of Theoretical Physics•Sep 17, 2022•0 citations

Cryptanalysis of Isogeny-Based Quantum Money with Rational Points

Hyeonhak Kim, Donghoe Heo, Seokhie Hong +2 more

Quantum money is a representative application in cryptography that utilizes quantum technology to achieve security that is unattainable with classical systems. Since the theoretical proposal by Wiesner in 1983, the most recent instantiation is the quantum money using class group actions on elliptic curves, proposed by Montgomery and Sharif in Asiacrypt'24. In this work, we propose a concrete cryptanalysis by leveraging the efficiency of evaluating division polynomials with the coordinates of rational points, offering a speedup of O ( log 4 ⁡ p ) compared to the brute-force attack. While the resulting attack still runs in exponential time, our method provides the first nontrivial algorithmic insight into their structural hardness. Furthermore, due to the algebraic properties of rational points and quadratic twists, our technique naturally yields a more efficient verification procedure for the underlying quantum money. We believe this new line of analysis opens promising directions for future research in elliptic-curve-based quantum cryptography.

arXiv:2508.00351•Quantum•Nov 10, 2026•0 citations

On Quantum Money and Evasive Obfuscation

Mark Zhandry

Lecture notes in computer science•Jan 1, 2025•2 citations
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.
Quantum money is a representative application in cryptography that utilizes quantum technology to achieve security that is unattainable with classical systems. Since the theoretical proposal by Wiesner in 1983, the most recent instantiation is the quantum money using class group actions on elliptic curves, proposed by Montgomery and Sharif in Asiacrypt'24. In this work, we propose a concrete cryptanalysis by leveraging the efficiency of evaluating division polynomials with the coordinates of rational points, offering a speedup of O ( log 4 ⁡ p ) compared to the brute-force attack. While the resulting attack still runs in exponential time, our method provides the first nontrivial algorithmic insight into their structural hardness. Furthermore, due to the algebraic properties of rational points and quadratic twists, our technique naturally yields a more efficient verification procedure for the underlying quantum money. We believe this new line of analysis opens promising directions for future research in elliptic-curve-based quantum cryptography.