Skip to main content
Conference ProceedingsOPEN ACCESS

Evaluating logarithms in GF(2n)

Proceedings of the Annual ACM Symposium on Theory of Computing (1984) 201-207
DOI: 10.1145/800057.808682
10Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

We present a method for determining logarithms in GF(2n). Its asymptotic running time is O( exp (en1/3log2/3n)) for a small constant c, while, by comparison, Adleman's scheme runs in time O( exp (cn1/2log1/2n)). The ideas give a dramatic improvement even for moderate-sized fields such as GF(2127), and make (barely) possible computations in fields of size around 2400. The method is not applicable to GF(q) for a large prime q.

Cite

CITATION STYLE

APA

Coppersmith, D. (1984). Evaluating logarithms in GF(2n). In Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 201–207). Association for Computing Machinery. https://doi.org/10.1145/800057.808682

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free