Discrete logarithm in GF(2809) with FFS

  title={Discrete logarithm in GF(2809) with FFS},
  author={Razvan Barbulescu and Cyril Bouvier and J{\'e}r{\'e}mie Detrey and Pierrick Gaudry and Hamza Jeljeli and Emmanuel Thom{\'e} and Marion Videau and Paul Zimmermann},
  journal={IACR Cryptology ePrint Archive},
The year 2013 has seen several major complexity advances for the discrete logarithm problem in multiplicative groups of smallcharacteristic finite fields. These outmatch, asymptotically, the Function Field Sieve (FFS) approach, which was so far the most efficient algorithm known for this task. Yet, on the practical side, it is not clear whether the new algorithms are uniformly better than FFS. This article presents the state of the art with regard to the FFS algorithm, and reports data from a… CONTINUE READING

From This Paper

Topics from this paper.
22 Citations
26 References
Similar Papers


Publications referenced by this paper.

Similar Papers

Loading similar papers…