On the Alpha Value of Polynomials in the Tower Number Field Sieve Algorithm

Abstract : In this paper, we provide a notable step towards filling the gap between theory (estimates of running-time) and practice (a discrete logarithm record computation) for the Tower Number Field Sieve (TNFS) algorithm. We propose a generalisation of ranking formula for selecting the polynomials used in the very first step of TNFS algorithm. For this we provide a definition and an exact implementation (Magma and SageMath) of the alpha function. This function measures the bias in the smoothness probability of norms in number fields compared to random integers of the same size. We use it to estimate the yield of polynomials, that is the expected number of relations, as a generalisation of Murphy's E function, and finally the total amount of operations needed to compute a discrete logarithm with TNFS algorithm in the targeted fields. This is an improvement of the earlier work of Barbulescu and Duquesne on estimating the running-time of the algorithm. We apply our estimates to a wide size range of finite fields GF(p^n), for small composite n = 12, 16, 18, 24, that are target fields of pairing-friendly curves.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [44 references]  Display  Hide  Download

https://hal.inria.fr/hal-02263098
Contributor : Aurore Guillevic <>
Submitted on : Friday, August 2, 2019 - 7:38:44 PM
Last modification on : Tuesday, August 6, 2019 - 1:12:53 AM

File

AlphaTNFS_20190801.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02263098, version 1

Collections

Citation

Aurore Guillevic, Shashank Singh. On the Alpha Value of Polynomials in the Tower Number Field Sieve Algorithm. 2019. ⟨hal-02263098⟩

Share

Metrics

Record views

22

Files downloads

186