Function Field Sieve (FFS) (Discrete Logarithm Over Finite Fields Logarithm Calculations)

From Algorithm Wiki

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/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=47516"