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

1 CARAMBA - Cryptology, arithmetic : algebraic methods for better algorithms
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : 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.
Type de document :
Article dans une revue
LMS Journal of Computation and Mathematics, London Mathematical Society, 2016, Special issue: Algorithmic Number Theory Symposium XII, 19, pp.332 - 350. <10.1112/S1461157016000164>
Domaine :

https://hal.inria.fr/hal-01273045
Contributeur : Laurent Grémy <>
Soumis le : lundi 22 février 2016 - 10:48:11
Dernière modification le : vendredi 7 octobre 2016 - 15:04:27
Document(s) archivé(s) le : dimanche 13 novembre 2016 - 00:10:14

### Fichier

article_higher.pdf
Fichiers produits par l'(les) auteur(s)

### Citation

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

Consultations de
la notice

## 365

Téléchargements du document