Selecting polynomials for the Function Field Sieve

Razvan Barbulescu

Paper 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.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Contact author(s): razvan barbulescu @ inria fr
History: 2013-04-09: received
Short URL: https://ia.cr/2013/200
License: CC BY

BibTeX

@misc{cryptoeprint:2013/200,
      author = {Razvan Barbulescu},
      title = {Selecting polynomials for the Function Field Sieve},
      howpublished = {Cryptology {ePrint} Archive, Paper 2013/200},
      year = {2013},
      url = {https://eprint.iacr.org/2013/200}
}