Cryptanalysis of three quantum money schemes

From MaRDI portal
Publication:6043565

DOI10.1007/S11128-023-03919-0arXiv2205.10488OpenAlexW4366368346MaRDI QIDQ6043565FDOQ6043565

Andriyan Bilyk, Javad Doliskani, Zhiyong Gong

Publication date: 23 May 2023

Published in: Quantum Information Processing (Search for Journal in Brave)

Abstract: We investigate the security assumptions behind three public-key quantum money schemes. Aaronson and Christiano proposed a scheme based on hidden subspaces of the vector space mathbbF2n in 2012. It was conjectured by Pena et al in 2015 that the hard problem underlying the scheme can be solved in quasi-polynomial time. We confirm this conjecture by giving a polynomial time quantum algorithm for the underlying problem. Our algorithm is based on computing the Zariski tangent space of a random point in the hidden subspace. Zhandry proposed a scheme based on multivariate hash functions in 2017. We give a polynomial time quantum algorithm for cloning a money state with high probability. Our algorithm uses the verification circuit of the scheme to produce a banknote from a given serial number. Kane, Sharif and Silverberg proposed a scheme based on quaternion algebras in 2021. The underlying hard problem in their scheme is cloning a quantum state that represents an eigenvector of a set of Hecke operators. We give a polynomial time quantum reduction from this hard problem to a linear algebra problem. The latter problem is much easier to understand, and we hope that our reduction opens new avenues to future cryptanalyses of this scheme.


Full work available at URL: https://arxiv.org/abs/2205.10488







Cites Work


Cited In (3)





This page was built for publication: Cryptanalysis of three quantum money schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6043565)