Publisher
Springer International Publishing
Reference76 articles.
1. L. M. Adleman, “A Subexponential Algorithmic for the Discrete Logarithm Problem with Applications to Cryptography”, Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science, IEEE Press, 1979, pp 55–60.
2. L. M. Adleman, “Algorithmic Number Theory – The Complexity Contribution”, Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, IEEE Press, 1994, pp 88–113.
3. L. M. Adleman, “The Function Field Sieve”, Algorithmic Number Theory (ANTS-I), Lecture Notes in Computer Science 877, Springer, 1994, pp 108–121.
4. L. M. Adleman and M. D. A. Huang, “Function Field Sieve Method for Discrete Logarithms over Finite Fields”, Information and Computation, 151, 1–2(1999), pp 5–16.
5. S. Bai and R. P. Brent, “On the Efficiency of Pollard’s Rho Method for Discrete Logarithms”, Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), Edited by J. Harland and P. Manyem, Wollongong, NSW, Australia, January 22–25, 2008, pp 125–131.