Discrete logarithms inGF(p)

@article{Coppersmith1986DiscreteLI,
  title={Discrete logarithms inGF(p)},
  author={Don Coppersmith and Andrew M. Odlyzko and Richard Schroeppel},
  journal={Algorithmica},
  year={1986},
  volume={1},
  pages={1-15}
}
Several related algorithms are presented for computing logarithms in fieldsGF(p),p a prime. Heuristic arguments predict a running time of exp((1+o(1)) $$\sqrt {\log p \log \log p} $$ ) for the initial precomputation phase that is needed for eachp, and much shorter running times for computing individual logarithms once the precomputation is done. The running time of the precomputation is roughly the same as that of the fastest known algorithms for factoring integers of size aboutp. The… CONTINUE READING
Highly Cited
This paper has 136 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 52 extracted citations

General purpose integer factoring

IACR Cryptology ePrint Archive • 2017
View 8 Excerpts
Method Support
Highly Influenced

A Tale of Two Sieves

View 5 Excerpts
Highly Influenced

Computation of Discrete Logarithms in Prime Fields

Des. Codes Cryptography • 1991
View 7 Excerpts
Method Support
Highly Influenced

Singular Curve Point Decompression Attack

2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC) • 2015

137 Citations

0510'88'95'03'11'19
Citations per Year
Semantic Scholar estimates that this publication has 137 citations based on the available data.

See our FAQ for additional information.