University of Surrey

Test tubes in the lab Research in the ATI Dance Research

On the Function Field Sieve and the Impact of Higher Splitting Probabilities

Göloğlu, Faruk, Granger, Robert, McGuire, Gary and Zumbrägel, Jens (2013) On the Function Field Sieve and the Impact of Higher Splitting Probabilities In: The 33rd Annual Cryptology Conference - Advances in Cryptology - CRYPTO 2013, 18-22 Aug 2013, Santa Barbara, CA, USA.

Full text not available from this repository.

Abstract

In this paper we propose a binary field variant of the JouxLercier medium-sized Function Field Sieve, which results not only in complexities as low as Lqn (1/3,(4/9)1/3) for computing arbitrary logarithms, but also in an heuristic polynomial time algorithm for finding the discrete logarithms of degree one and two elements when the field has a subfield of an appropriate size. To illustrate the efficiency of the method, we have successfully solved the DLP in the finite fields with 21971 and 23164 elements, setting a record for binary fields.

Item Type: Conference or Workshop Item (Conference Paper)
Divisions : Faculty of Engineering and Physical Sciences > Computing Science
Authors :
NameEmailORCID
Göloğlu, Faruk
Granger, Robertr.granger@surrey.ac.uk
McGuire, Gary
Zumbrägel, Jens
Date : 18 August 2013
DOI : 10.1007/978-3-642-40084-1_7
Copyright Disclaimer : © International Association for Cryptologic Research 2013
Uncontrolled Keywords : Discrete logarithm problem; Function field sieve
Depositing User : Clive Harris
Date Deposited : 07 Feb 2019 13:31
Last Modified : 07 Feb 2019 13:31
URI: http://epubs.surrey.ac.uk/id/eprint/850402

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