Evaluating logarithms in GF(2n)

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1984, Pages 201-207

  Coppersmith, Don ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

IN-FIELD; RUNNING TIME;

COMPUTATION THEORY;

EID: 35048841880     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800057.808682     Document Type: Conference Paper

References (13)

1. [A] L. Adleman, "A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography, " Proc. IEEE 20th Annual Symposium on Foundations of Computer Science, 55-60 (1979).
2. [B] E.R. Berlekamp, "Factoring polynomials over finite fields, " Bell System Tech. J. 46(1967), pp. 1853-1859.
3. [BFMV] I.F. Blake, R. Fuji-Hara, R.C. Mullin and S.A. Vanstone, "Computing Logarithms in Finite Fields of Characteristic Two." Submitted to SlAM Journal on Algebraic and Discrete Methods.
4. [c] D. Coppersmith, "Fast Evaluation of Logarithms in Fields of Characteristic Two, " Research Report No. RC 10187, IBM T. J. Watson Research Center, Yorktown Heights, N. Y., 10598, October 3, 1983; to appear, IEEE Transactions on Information Theory.
5. [DH] W. Diffie and M.E. Hellman, "New Directions in Cryptography, " IEEE Trans. Information Theory, vol. IT-22, pp.644-654 (1976).
6. [H] M.E. Hellman, "On the Difficulty of Computing Logarithms Over GF(QM), '' Proceedings of the 1980 Symposium on Security and Privacy, Oakland, CA, April 14-16, 1980, 83(1980).
7. [HR] M.E. Hellman and J.M. Reyneri, "Fast computation of discrete logarithms in GF(q)", Advances in Cryptography: Proceedings of CR YPTO "82, D. Chaum, R. Rivest, and A. Sherman, eds., pp. 3-13, Plenum Press, 1983.
8. [JT] R.D. Jenks and B.M. Trager, "A Language for Computational Algebra, " Proc. SYMSAC 81, P.S. Wang, editor, pp. 6-13. ACM, New York, 1981.
9. [K] D.E. Knuth, The Art Of Computer Programming, volume 2, pp. 351-354. Addison-Wesley, 1971.
10. [M] J.L. Massey, "Logarithms in finite cyclic groups-cryptographic issues, " 4-th Symp. on Info. Th. in BENELUX, Haasrode, Belgium, May 26-27, 1983; preprint.
11. [MB] M. Morrison and J. Brillhart, "A Method of Factoring and the Factorization of FT, " Math. Comp., v. 29, 129, pp. 183-205.
12. [O] A.M. Odlyzko, "Discrete logarithms in finite fields and their cryptographic significance, " Bell Laboratories Internal Technical Memorandum, September 27, 1983.
13. [z] N. Zierler, "A conversion algorithm for logarithms on GF(2n), '' Journal of Pure and Applied Algebra 4 (1974), pp. 353-356.