Cryptology ePrint Archive: Report 2013/200

Selecting polynomials for the Function Field Sieve

Razvan Barbulescu

Abstract: The Function Field Sieve algorithm is dedicated to computing discrete logarithms in a finite field GF(q^n) , where q is a small prime power. The scope of this article is to select good polynomials for this algorithm by defining and measuring the size property and the so-called root and cancellation properties. In particular we present an algorithm for rapidly testing a large set of polynomials. Our study also explains the behaviour of inseparable polynomials, in particular we give an easy way to see that the algorithm encompass the Coppersmith algorithm as a particular case.

Category / Keywords: public-key cryptography /

Date: received 7 Apr 2013

Contact author: razvan barbulescu at inria fr

Available format(s): PDF | BibTeX Citation

Version: 20130409:050847 (All versions of this report)

Short URL: ia.cr/2013/200

Discussion forum: Show discussion | Start new discussion