1. Shor, P.: Algorithms for Quantum Computation: Discrete Logarithms and Factoring. In: Proceedings of FOCS’94, 124-134 (1994)
2. Proos, J., Zalka, C.: Shor’s discrete logarithm quantum algorithm for elliptic curves. Quantum Inf. Comput. 3, 317 (2003)
3. Kaye, P.: Optimized quantum implementation of elliptic curve arithmetic over binary fields. Quantum Inf. Comput. 5, 474 (2005)
4. Cheung, D., Mathew, J., Pradhan, D., et al.: On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography. Lecture Notes in Computer Science Vol. 5106 (Springer Berlin), 96-104 (2007)
5. Brassard, G., Hoyer, P.: An Exact Quantum Polynomial-Time Algorithm for Simon’s Problem. In: Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems (Ramat Gan, Israel), 12-23 (1997)