The Function Field Sieve in the Medium Prime Case

@inproceedings{Joux2006TheFF,
  title={The Function Field Sieve in the Medium Prime Case},
  author={Antoine Joux and Reynald Lercier},
  booktitle={EUROCRYPT},
  year={2006}
}
In this paper, we study the application of the function field sieve algorithm for computing discrete logarithms over finite fields of the form Fqn when q is a medium-sized prime power. This approach is an alternative to a recent paper of Granger and Vercauteren for computing discrete logarithms in tori, using efficient torus representations. We show that when q is not too large, a very efficient L(1/3) variation of the function field sieve can be used. Surprisingly, using this algorithm… CONTINUE READING
Highly Influential
This paper has highly influenced 14 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Figures, tables, and topics from this paper.
59 Citations
27 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 59 extracted citations

Similar Papers

Loading similar papers…