Collecting relations for the number field sieve in $GFp^6$Report as inadecuate

Collecting relations for the number field sieve in $GFp^6$ - Download this document for free, or read online. Document in PDF available to download.

1 CARAMBA - Cryptology, arithmetic : algebraic methods for better algorithms Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry 2 Quarkslab

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 GFp^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.

Author: Pierrick Gaudry - Laurent Grémy - Marion Videau -



Related documents