Function Field Sieve (FFS) (Discrete Logarithm Over Finite Fields Logarithm Calculations): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O({2}^n)$ == Space Complexity == $O(n^{2/3})$? bits (Derived: same space as Number Field Sieve?) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1999 == Reference == https://www.sciencedirect.com/science/article/pii/S0890540198927614") |
No edit summary |
||
| Line 7: | Line 7: | ||
$O(n^{2/3})$? bits | $O(n^{2/3})$? bits | ||
( | (same space as Number Field Sieve?) | ||
== Description == | == Description == | ||
Latest revision as of 09:50, 10 April 2023
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/science/article/pii/S0890540198927614