Estimates for Discrete Logarithm Computations in Finite Fields of Small Characteristic

We give estimates for the running-time of the function field sieve (FFS) to compute discrete logarithms in $\mathbb{F}_{p^n}^{\times}$ for small $p$. Specifically, we obtain sharp probability estimates that allow us to select optimal parameters in cases of cryptographic interest, without appealing to the heuristics commonly relied upon in an asymptotic analysis. We also give evidence that for any fixed field size some may be weaker than others of a different characteristic or field representation, and compare the relative difficulty of computing discrete logarithms via the FFS in such cases.


Editor(s):
Paterson, Kenneth G.
Published in:
Cryptography and Coding, 9th IMA International Conference, Cirencester, UK, December 16-18, 2003. Proceedings, 190-206
Presented at:
Cryptography and Coding, Cirencester, UK, December 16-18, 2003
Year:
2003
Publisher:
Springer Berlin Heidelberg
Laboratories:




 Record created 2016-01-19, last modified 2018-03-17

External link:
Download fulltext
URL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)