Laurent Grémy

Learn More
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 F p 6 with the Number Field Sieve. We provide new insights, improvements, and comparisons between different methods to select polynomials intended for a sieve(More)
  • 1