Virtual logarithms

Journal of Algorithms

Volumn 57, Issue 2, 2005, Pages 140-147

  Schirokauer, Oliver ^a  

^a OBERLIN COLLEGE   (United States)

Author keywords

Discrete logarithm; Finite field; Number field sieve

Indexed keywords

NUMBER THEORY; VIRTUAL REALITY;

DISCRETE LOGARITHM; FINITE FIELD; NUMBER FIELD SIEVE; NUMBER RING;

ALGORITHMS;

EID: 27144539499     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2004.11.004     Document Type: Article

References (19)

1. L.M. Adleman The function field sieve Algorithmic Number Theory, ANTS-I L.M. Adleman M.-D. Huang Lecture Notes in Comput. Sci. vol. 877 1994 Springer-Verlag Berlin 108 121
2. L.M. Adleman, and M.-D. Huang Function field method for discrete logarithms over finite fields Inform. and Comput. 151 1999 5 16
3. J.P. Buhler, H.W. Lenstra Jr., and C. Pomerance Factoring integers with the number field sieve A.K. Lenstra H.W. Lenstra Jr. The Development of the Number Field Sieve Lecture Notes in Math. vol. 1554 1993 Springer-Verlag Berlin 50 94
4. H. Cohen A Course in Computational Algebraic Number Theory 1993 Springer-Verlag Berlin
5. D. Gordon Discrete logarithms using the number field sieve SIAM J. Discrete Math. 6 1993 125 138
6. A. Joux, and R. Lercier Discrete logarithms in GF (p ) posted to the number theory archives http://listserv.nodak.edu/archives/nmbrthry.html April 2001
7. A. Joux, and R. Lercier Improvements on the general number field sieve for discrete logarithms in prime fields Math. Comp. 72 2003 953 967
8. S. Lang Algebraic Number Theory 1970 Addison-Wesley Reading, MA
9. A.K. Lenstra H.W. Lenstra Jr. The Development of the Number Field Sieve Lecture Notes in Math. vol. 1554 1993 Springer-Verlag Berlin
10. D.A. Marcus Number Fields 1977 Springer-Verlag New York
11. K. McCurley The discrete logarithm problem Cryptology and Computational Number Theory C. Pomerance Proc. Sympos. Appl. Math. vol. 42 1990 Amer. Math. Soc. 49 74
12. O. Schirokauer Discrete logarithms and local units Theory and Applications of Numbers without Large Prime Factors R.C. Vaughan Philos. Trans. Roy. Soc. London Ser. A vol. 345 1993 Royal Society London 409 424
13. O. Schirokauer Using number fields to compute logarithms in finite fields Math. Comp. 69 2000 1267 1283
14. O. Schirokauer The special function field sieve SIAM J. Discrete Math. 16 2002 81 98
15. O. Schirokauer, The impact of the number field sieve on the discrete logarithm problem, in: J.P. Buhler, P. Stevenhagen (Eds.), Proceedings of a Conference at the Mathematical Sciences Research Institute, Algorithmic Number Theory: Lattices, Number Fields, Curves, and Cryptography, Cambridge University Press, in press
16. O. Schirokauer, D. Weber, and T. Denny Discrete logarithms: the effectiveness of the index calculus method Algorithmic Number Theory, ANTS-II H. Cohen Lecture Notes in Comput. Sci. vol. 1123 1996 Spring-Verlag Berlin 337 361
17. D. Weber Computing discrete logarithms with the number field sieve Algorithmic Number Theory, ANTS-II H. Cohen Lecture Notes in Comput. Sci. vol. 1123 1996 Springer-Verlag Berlin 391 403
18. D. Weber, and T. Denny The solution of McCurley's discrete log challenge Advances in Cryptology - Crypto '98 H. Krawczyk Lecture Notes in Comput. Sci. vol. 1462 1998 Springer-Verlag 458 471
19. D.H. Wiedemann Solving sparse linear equations over finite fields IEEE Trans. Inform. Theory 32 1986 54 62