On the Alpha Value of Polynomials in the Tower Number Field Sieve Algorithm - Archive ouverte HAL Access content directly
Journal Articles Mathematical Cryptology Year : 2021

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

(1) , (2)
1
2

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(pn), for small composite n = 12, 16, 18, 24, that are target fields of pairing-friendly curves.
Fichier principal
Vignette du fichier
Guillevic-Singh-TNFS-alpha-2021-02-20.pdf (503.77 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02263098 , version 1 (02-08-2019)
hal-02263098 , version 2 (22-02-2021)

Licence

Attribution - NonCommercial - CC BY 4.0

Identifiers

  • HAL Id : hal-02263098 , version 2

Cite

Aurore Guillevic, Shashank Singh. On the Alpha Value of Polynomials in the Tower Number Field Sieve Algorithm. Mathematical Cryptology, 2021, 1 (1), pp.1-39. ⟨hal-02263098v2⟩
284 View
196 Download

Share

Gmail Facebook Twitter LinkedIn More