1. L.M. Adleman, A subexponential algorithm for the discrete logarithm problem with applications to cryptology, in 20th Annual Symposium on the Foundations of Computer Science (1979), pp. 55–60
2. L.M. Adleman, J. DeMarrais, M.D. Huang, A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields, Algorithmic Number Theory. LNCS, vol. 877 (Springer, Berlin, 1994)
3. A.O.L. Atkin, F. Morain, Elliptic curves and primality proving. Math. Comput. 61(205), 29–68 (1993)
4. R. Balasubramanian, N. Koblitz, The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm. J. Cryptol. 11, 141–145 (1998)
5. E. Bernstein, U. Vazirani, Quantum complexity theory, in Proceedings of 26th ACM Symposium on Theory of Computation (1993)