Author:
Hong Haibo,Wang Licheng,Ahmad Haseeb,Yang Yixian,Qu Zhiguo
Publisher
Springer Science and Business Media LLC
Reference39 articles.
1. Shor P. Polynomial time algorithms for prime factorization and discrete logarithms on quantum computers. SIAM J Comput, 1997, 26: 1484–1509
2. Proos J, Zalka C. Shor’s discrete logarithm quantum algorithm for elliptic curves. Quantum Inf Comput, 2003, 3: 317–344
3. Blaser M. Noncommutativity makes determinants hard. Electr Coll Comp Complex Report. No. 142. 2012
4. Rotteler M. Quantum algorithms: a survey of some recent results. Inf Forsch Entw, 2006, 21: 3–20
5. Wagner N, Magyarik M. A public-key cryptosystem based on the word problem. In: Proceedings of CRYPTO’84 on Advances in Cryptology. Berlin: Springer, 1985. 19–36
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献