ZGZhiyong Gong
Zhiyong Gong
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Zhiyong Gong has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Andriyan Bilyk
Department of Computer Science, Ryerson University, Toronto, Canada
2 shared publications - Javad Doliskani
Department of Computer Science Ryerson University Toronto Canada
2 shared publications
Latest Publications
- 19 April 2023
- Published by Springer Nature in Quantum Information Processing
- Vol. 22 (4) , 1-27
Cryptanalysis of three quantum money schemes
- 19 April 2023
- Published by Springer Nature in Quantum Information Processing
- Vol. 22 (4) , 1-27
Cryptanalysis of three quantum money schemes
- Open Access
Cryptanalysis of Three Quantum Money Schemes
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 $\mathbb{F}_2^n$ 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.Open AccessCryptanalysis of Three Quantum Money Schemes
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 $\mathbb{F}_2^n$ 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.