Skip to Main content Skip to Navigation
Journal articles

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

Abstract : 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 F, with |F| ≠ 2, 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 F2 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 F2 and succeeds with such probability.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/hal-02395072
Contributor : Ludovic Perret <>
Submitted on : Thursday, December 5, 2019 - 11:14:15 AM
Last modification on : Saturday, December 7, 2019 - 1:38:10 AM

Identifiers

Citation

Marta Conde Pena, Raul Durán Díaz, Jean-Charles Faugère, Luis Hernández Encinas, Ludovic Perret. Non-quantum cryptanalysis of the noisy version of Aaronson–Christiano's quantum money scheme. IET Information Security, Institution of Engineering and Technology, 2019, 13 (4), pp.362-366. ⟨10.1049/iet-ifs.2018.5307⟩. ⟨hal-02395072⟩

Share

Metrics

Record views

54