A subexponential algorithm for discrete logarithms over all finite fields

Mathematics of Computation

Volumn 61, Issue 203, 1993, Pages 1-15

  Adleman, Leonard M ^a   Demarrais, Jonathan ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84966236672     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-1993-1225541-3     Document Type: Article

References (28)

1. L. M. Adleman, A subexponential algorithm for discrete logarithms with applications to cryptography, Proc. 20th IEEE Found. Comp. Sei. Symp., IEEE Computer Society, Long Beach, CA, 1979, pp. 55-60.
2. L. M. Adleman, Factoring numbers using singular integers, Proc. 23rd Annual ACM Symposium on Theory of Computing, Assoc. Comput. Mach., New York, 1991, pp. 64-71.
3. L. M. Adleman and M.-D. A. Huang, Primality testing and Abelian varieties over finite fields, Lecture Notes in Math., vol. 1512, Springer-Verlag, Berlin, 1992.
4. L. M. Adleman and H. W. Lenstra, Jr., Finding irreducible polynomials over finite fields, Proc. 18th Annual ACM Symposium on Theory of Computing, Assoc. Comput. Mach., New York, 1986, pp. 350-355.
5. E. Berlekamp, Factoring polynomials over large finite fields, Math. Comp. 24 (1970), 713- 735.
6. E. Bach and J. Shallit, Factoring with cyclotomic polynomials, Proc. 26th IEEE Found. Comp. Sei. Symp., IEEE Computer Society, Los Angeles, CA, 1985, pp. 443-450.
7. E. R. Canfield, P. Erdös, and C. Pomerance, On a problem of Oppenheim concerning "Factorisatio Numerorum", J. Number Theory 17 (1983), 1-28.
8. D. Coppersmith, Fast evaluation of logarithms infields of characteristic two, IEEE Trans. Inform. Theory IT-30 (1984), 587-594.
9. D. Coppersmith, A. M. Odlyzko, and R. Schroeppel, Discrete logarithms in GF(p), Algorithmica, 1 (1986), 1-15.
10. W. Diffe and M. E. Hellman, New directions in cryptography, IEEE Trans. Inform. Theory IT-22 (1976), 644-654.
11. H. M. Edwards, Fermât ’s Last Theorem, Graduate Texts in Math., vol. 50, Springer-Verlag, New York, 1977.
12. T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Trans. Inform. Theory IT-31 (1985), 469-472.
13. T. ElGamal, A subexponential-time algorithm for computing discrete logarithms over GF(p2), IEEE Trans. Inform. Theory IT-31 (1985), 473-481.
14. K. F. Gauss, Disquisitiones arithmeticae, translation A. A. Clarke, Yale Univ. Press, New Haven, CT, 1966.
15. D. M. Gordon, Discrete logarithms in GF(p) using the number field sieve, manuscript, April 4, 1990.
16. M. E. Hellman and J. M. Reyneri, Fast computation of discrete logarithms in GF(pn), Advances in Cryptography: Proceedings of CRYPTO '82 (D. Chaum, R. Rivest, A. Sherman, eds.), Plenum Press, New York, 1983, pp. 3-13.
17. H. W. Lenstra, Jr., Finding isomorphisms between finite fields, Math. Comp. 56 (1991), 329-347.
18. H. W. Lenstra, Factoring integers with elliptic curves, Ann. of Math. (2) 126 (1987), 649-673.
19. A. K. Lenstra, H. W. Lenstra, Jr., M. S. Manasse, and J. M. Pollard, The number field sieve, Proc. 22nd STOC, Assoc. Comput. Mach., New York, 1990, pp. 564-572.
20. R. Lovorn, Rigorous, subexponential algorithms for discrete logarithms over finite fields, Ph.D. Thesis, University of Georgia, May 1992.
21. M. Newman, Bounds for class numbers, Proc. Sympos. Pure Math., vol. 8, Amer. Math. Soc, Providence, RI, 1965, pp. 70-77.
22. A. M. Odlyzko, Discrete logarithms in finite fields and their cryptographic significance, Proceedings of Eurocrypt '84 (T. Beth, N. Cot, and I. Ingemarsson, eds.), Lecture Notes in Comput. Sei., vol. 209, Springer-Verlag, Berlin, 1985, pp. 224-314.
23. C. Pomerance, Fast, rigorous factorization and discrete logarithms, Discrete Algorithms and Complexity (D. S. Johnson, T. Nishizeki, A. Nozaki, and H. S. Wilf, eds.), Academic Press, Orlando, FL, 1987, pp. 119-144.
24. M. O. Rabin, Probabilistica lgorithmsi n finite fields, SIAMJ. Comput. 9 (1980), 273-280.
25. R. Solovay and V. Strassen, A fast Monte-Carlo test for primality, SIAM J. Comput. 6 (1977), 84-85.
26. L. C. Washington, Introduction to cyclotomic fields, Graduate Texts in Math., vol. 83, Springer-Verlag, New York, 1982.
27. D. Wiederman, Solving sparse linear equations over finite fields, IEEE Trans. Inform. Theory. IT-32 (1986), 54-62.
28. A. E. Western and J. C. P. Miller, Tables of indices and primitive roots, Royal Society Mathematical Tables, vol. 9, Cambridge Univ. Press, 1968.