Number Field Sieve (NFS) (Discrete Logarithm Over Finite Fields Logarithm Calculations)
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