Number Field Sieve (NFS) (Discrete Logarithm Over Finite Fields Logarithm Calculations)

From Algorithm Wiki
Revision as of 12:17, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({2}^n)$ == Space Complexity == $O(n^{2/3})$ bits (http://www.ams.org/notices/199612/pomerance.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1990 == Reference == http://www.ams.org/notices/199612/pomerance.pdf")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O({2}^n)$

Space Complexity

$O(n^{2/3})$ bits

(http://www.ams.org/notices/199612/pomerance.pdf)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

1990

Reference

http://www.ams.org/notices/199612/pomerance.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Number_Field_Sieve_(NFS)_(Discrete_Logarithm_Over_Finite_Fields_Logarithm_Calculations)&oldid=45515"