An algorithm for evaluation of discrete logarithms in some nonprime finite fields

Mathematics of Computation

Volumn 67, Issue 224, 1998, Pages 1679-1689

  Semaev, Igor A ^a  

^a Apartment #723 ^*  (Russian Federation)

Author keywords

Cryptography; Discrete logarithms; Finite fields

Indexed keywords

EID: 0039523561     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/s0025-5718-98-00969-7     Document Type: Article

References (8)

1. W. Diffie and M. Hellman, New directions in cryptography, IEEE Trans. Inform. Theory, IT-22 (1976), 644-654. MR 55:10141
2. S. Pohlig and M. Hellman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Trans. Inform. Theory IT-24 (1978) 106-110. MR 58:4617
3. L. Adleman, A subexponential algorithm for the discrete logarithm problem with applications to cryptography, 20th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, New York. 1979, pp. 55-60. MR 82a:68004
4. A. Odlyzko, Discrete logarithms in finite fields and their cryptographic significance, Advances in Cryptology, Springer, Berlin and New York, 1985. pp. 224-814. MR 87g:11022
5. D. Coppersmith, Fast evaluation of logarithms in fields of characteristic two, IEEE Trans. Inform. Theory IT-30 (1984), 587-594. MR 85h:65041
6. I. A. Semaev, The number of small solutions of a linear homogeneous congruence, Mat. Zametki 50 (1991), 102-197: English transl. in Math. Notes, 50 (1991). MR 93c:11001
7. I. A. Semaev, The number of small solutions of a linear homogeneous congruence, Mat. Zametki 50 (1991), 102-197: English transl. in Math. Notes, 50 (1991). MR 93c:11001
8. O. Schirokauer, D. Weber and T. Denny, Discrete logarithms: the effectiveness of the index calculus method, Algorithmic number theory, Lecture notes in computer science; vol. 1122, Springer, Berlin and New York, 1996, pp. 337-361.