Function Field Sieve Method for Discrete Logarithms over Finite Fields

Information and Computation

Volumn 151, Issue 1-2, 1999, Pages 5-16

  Adleman, Leonard M ^a   Huang, Ming Deh A ^a  

^a University of Southern California ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013368050     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1998.2761     Document Type: Article

References (30)

1. Adleman, L. M. (1979), A subexponential algorithm for the discrete logarithm problem with applications to cryptography, in "Proc. 20th IEEE Found. Comp. Sci. Symp.," pp. 55-60.
2. Adleman, L. M. (1994), The function field sieve, in "Algorithmic Number Theory (ANTS-I)," Lecture Notes in Computer Science, Vol. 877, pp. 108-121, Springer-Verlag, New York/Berlin.
3. Buhler, J. P., Lenstra Jr., H. W., and Pomerance, C. (1993), Factoring integers with the number field sieve, in "The Development of the Number Field Sieve," Lecture Notes in Mathematics, Vol. 1554, pp. 50-94, Springer-Verlag, New York/Berlin.
4. Chistov, A. L. (1989), The complexity of constructing the ring of integers of a global field, Soviet Math. Dokl. 39, No. 3, 597-600.
5. Coates, J. (1970), Construction of rational functions on a curve, Proc. Camb. Phil. Soc. 68, 105-123.
6. Coppersmith, D. (1984), Fast evaluation of discrete logarithms in fields of characteristic two, IEEE Trans. Inform. Theory IT-39, 587-594.
7. Dicrescenzo, C., and Duval, D. (1984), Computations on curves, in "Eurosam 84: Proc. Int'l Symp. on Symbolic and Algebraic Computation," Lecture Notes in Computer Science, Vol. 174, pp. 100-107, Springer-Verlag, New York/Berlin.
8. Diffie, W., and Hellman, M. (1976), New directions in cryptography, IEEE Trans. Inform. Theory 22, 472-492.
9. ElGamal, T. (1985), A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Trans. Inform. Theory 31, 469-472.
10. Fulton, W. (1969), "Algebraic Curves," Benjamin, Elmsford, NY.
11. Gordon, D. (1993), Discrete logarithms in GF(p) using the number field sieve, SIAM J. Discrete Math. 6, 124-138.
12. Lenstra, A. K., and Lenstra Jr., H. W. (Eds.) (1993), "The Development of the Number Field Sieve," Lecture Notes in Mathematics, Vol. 1554, Springer-Verlag, New York/Berlin.
13. Lenstra, A. K., Lenstra Jr., H. W., Manasse, M. S., and Pollard, J. M. (1990), The number field sieve, in "Proc. 22nd ACM Symp. on Theory of Computing," pp. 564-572.
14. Lovorn, R. (1992), "Rigorous Subexponential Algorithms for Discrete Logarithms over Finite Fields," Ph.D. thesis, University of Georgia.
15. Lovorn Bender, R., and Pomerance, C. (1995), Rigorous discrete logarithm computations in finite fields via smooth polynomials, preprint.
16. McCurley, K. (1990), The discrete logarithm problem, in "Cryptology and Computational Number Theory," Proc. Symp. in Applied Math., Vol. 42, pp. 49-74, AMS, Providence, RI.
17. Merkle, R. (1979), "Secrecy, Authentication, and Public Key Systems," Ph.D. thesis, Stanford University.
18. National Bureau of Standards, (1994), "Digital signature standard," FIPS Publication 186, Washington, DC.
19. Odlyzko, A. (1985), Discrete logarithms in finite fields and their cryptographic significance, in "Advances in Cryptology-Eurocrypt '84," Lecture Notes in Computer Science, Vol. 209, pp. 224-314, Springer-Verlag, New York/Berlin.
20. Pollard, J. (1978), Monte Carlo methods for index computations (mod p), Math. Comp. 32, 918-924.
21. Pomerance, C. (1987), Fast rigorous factorization and discrete logarithms algorithms, in "Discrete Algorithms and Complexity" (D. S. Johnson, T. Nishizeki, A. Nozaki, and H. Wilf, Eds), pp. 119-143, Academic Press, New York.
22. Schirokauer, O. (1993), Discrete logarithms and local units, Phil. Trans. R. Soc. Lond. A 345, 409-423.
23. Schirokauer, O., Weber, D., and Denny, T. (1996), Discrete logarithms: The effectiveness of the index calculus method, in "Algorithmic Number Theory (ANTS-II)," Lecture Notes in Computer Science, Vol. 1122, pp. 337-362, Springer-Verlag, New York/Berlin.
24. Soundararajan, K. (1998), Smooth polynomials: analogies and asymptotics, preprint.
25. Stichtenoth, H. (1993), "Algebraic Function Fields and Codes," Springer-Verlag, New York/Berlin.
26. Walker, R. (1978), "Algebraic Curves," Springer-Verlag, New York/Berlin.
27. Adleman, L. M., and DeMarrais, J. (1993), A subexponential algorithm for discrete logarithms over all finite fields, Math. Comp. 63.
28. Canfield, E. R., Erdös, P., and Pomerance, P. (1983), On a problem of Oppenheim concerning "Favtorisatio Numerorum", J. Number Theory 17, 1-28.
29. Coppersmith, D., Odlyzko, A., and Schroeppel, R. (1986), Discrete logarithms in GF(p), Algorithmica 1, 1-15.
30. Rivest, R., Shamir, A., and Adleman, L. (1978), A method for obtaining digital signatures and public key cryptosystems, Communication ACM 21, 120-126.