Function Field Sieve (FFS) (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 (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")

(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

(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

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