Finite-field DLP / Prime fields · classical heuristic

Discrete Logarithms in GF(P) Using the Number Field Sieve

Daniel M. Gordon

SIAM Journal on Discrete Mathematics 1993

PublishedSource checked

Time bound: L_p[1/3, 3^2/3]
Space bound: Not extracted from the source

Source / version date: Feb 1993
Comparison variant: Prime fields · classical heuristic
Cost scale: L_p[1/3,c]
coefficientExact: 3^{2/3}

Assumptions and source notes

Heuristic expected full discrete-logarithm computation in a general prime field, as stated in the paper abstract.

Source location

Abstract
Version: Version available at the cited URL; bibliographic metadata and stated bound checked on 2026-11-08

Primary source ↗

BibTeXDownload .bib

@article{gordon93,
  author = {Daniel M. Gordon},
  title = {{Discrete Logarithms in GF(P) Using the Number Field Sieve}},
  journal = {SIAM Journal on Discrete Mathematics 6(1), 124–138},
  year = {1993},
  doi = {10.1137/0406010},
  url = {https://epubs.siam.org/doi/10.1137/0406010},
  keywords = {prime fields, discrete logarithms, number field sieve},
  cr_date = {1993-02-28},
  cr_date_precision = {month},
  cr_status = {published},
  cr_venue = {SIAM Journal on Discrete Mathematics 6(1), 124–138},
  cr_author_ids = {daniel-m-gordon}
}