1. L.M. Adleman, A subexponential algorithm for the discrete logarithm problem with applications to cryptography, in Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science (IEEE Press, New York, 1979), pp. 55–60
2. L.M. Adleman, Algorithmic number theory—the complexity contribution, in Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science (IEEE Press, New York, 1994), pp. 88–113
3. L.M. Adleman, The function field Sieve, in Algorithmic Number Theory (ANTS-I). Lecture Notes in Computer Science, vol. 877 (Springer, Berlin, 1994), pp. 108–121
4. L.M. Adleman, M.D.A. Huang, Function field sieve method for discrete logarithms over finite fields. Inform. Comput. 151(1–2), 5–16 (1999)
5. S. Bai, R.P. Brent, On the efficiency of Pollard’s Rho method for discrete logarithms, in Proceedings of Fourteenth Computing: The Australasian Theory Symposium, Wollongong, 22–25 January 2008, pp. 125–131, ed. by J. Harland, P. Manyem