Collecting relations for the number field sieve in $GF(p^6)$ - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles LMS Journal of Computation and Mathematics Year : 2016

Collecting relations for the number field sieve in $GF(p^6)$


In order to assess the security of cryptosystems based on the discrete logarithm problem in non-prime finite fields, as are the torus-based or pairing-based ones, we investigate thoroughly the case in GF(p^6) with the Number Field Sieve. We provide new insights, improvements, and comparisons between different methods to select polynomials intended for a sieve in dimension 3 using a special-q strategy. We also take into account the Galois action to increase the relation productivity of the sieving phase. To validate our results, we ran several experiments and real computations for various selection methods and field sizes with our publicly available implementation of the sieve in dimension 3, with special-q and various enumeration strategies.
Fichier principal
Vignette du fichier
article_higher.pdf (895.77 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01273045 , version 1 (11-02-2016)
hal-01273045 , version 2 (22-02-2016)



Pierrick Gaudry, Laurent Grémy, Marion Videau. Collecting relations for the number field sieve in $GF(p^6)$. LMS Journal of Computation and Mathematics, 2016, Special issue: Algorithmic Number Theory Symposium XII, 19, pp.332 - 350. ⟨10.1112/S1461157016000164⟩. ⟨hal-01273045v2⟩
575 View
315 Download



Gmail Facebook X LinkedIn More