Higher dimensional sieving for the number field sieve algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2018

Higher dimensional sieving for the number field sieve algorithms

Laurent Grémy


Since 2016 and the introduction of the exTNFS (extended Tower Number Field Sieve) algorithm, the security of cryptosystems based on non-prime finite fields, mainly the paring and torus-based one, is being reassessed. The feasibility of the relation collection, a crucial step of the NFS variants, is especially investigated. It usually involves polynomials of degree one, i.e., a search space of dimension two. However, exTNFS uses bivariate polynomials of at least four coefficients. If sieving in dimension two is well described in the literature, sieving in higher dimension received significantly less attention. We describe and analyze three different generic algorithms to sieve in any dimension for the NFS algorithms. Our implementation shows the practicability of dimension four sieving, but the hardness of dimension six sieving.
Fichier principal
Vignette du fichier
article.pdf (512.48 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01890731 , version 1 (08-10-2018)


  • HAL Id : hal-01890731 , version 1


Laurent Grémy. Higher dimensional sieving for the number field sieve algorithms. ANTS 2018 - Thirteenth Algorithmic Number Theory Symposium, University of Wisconsin, Jul 2018, Madison, United States. pp.1-16. ⟨hal-01890731⟩
88 View
159 Download


Gmail Facebook X LinkedIn More