Function Field Sieve (FFS) (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
(same space as Number Field Sieve?)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
1999
Reference
https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/S0890540198927614