University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Estimates for Discrete Logarithm Computations in Finite Fields of Small Characteristic

Granger, Robert (2003) Estimates for Discrete Logarithm Computations in Finite Fields of Small Characteristic In: The 9th IMA International Conference on Cryptography and Coding, 16-18 Dec 2003, Cirencester, UK.

Full text not available from this repository.

Abstract

We give estimates for the running-time of the function field sieve (FFS) to compute discrete logarithms in F×pn 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.

Item Type: Conference or Workshop Item (Conference Paper)
Divisions : Faculty of Engineering and Physical Sciences > Computing Science
Authors :
NameEmailORCID
Granger, Robertr.granger@surrey.ac.uk
Date : 16 December 2003
DOI : 10.1007/978-3-540-40974-8_16
Copyright Disclaimer : © Springer-Verlag Berlin Heidelberg 2003
Depositing User : Clive Harris
Date Deposited : 08 Feb 2019 14:31
Last Modified : 08 Feb 2019 14:31
URI: http://epubs.surrey.ac.uk/id/eprint/850417

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800