Aurore Guillevic

Email : aurore guillevic [] inria fr


CADO-NFS and the Number Field Sieve to compute discrete logarithms in finite fields

I am one of the developers of the cado-nfs software.
See also CATREL Workshop presentation by Pierrick Gaudry.

Polynomial Selection for NFS-DL in non-prime finite fields

I contribute to the polynomial selection for large characteristic non-prime fields. For the moment, the polynomial selection for quadratic extensions of large prime fields with the Conjugation method is available. The polynomial selection for cubic, quartic and sextic fields is under development, at the state of a magma prototype.

Individual Discrete Logarithms in non-prime finite fields

The code of the paper is also under development, at a Magma stage for the moment. A C/C++ cado-nfs version might be planed for 2016.

Pairing Implementation

I am usually contacted by researchers who would like to use the source code I developed in my thesis, to compare the efficiency of pairings over prime order groups and over composite-order groups. This comparison was discussed in the paper Unfortunately for confidentiality reasons the source code is not available but here are alternative libraries to efficiently compute pairings over elliptic curves. These two above libraries are the fastest ones as far as I know. Please feel free to contact me if you have better suggestions. Here is another one I heard about: If you prefer a more user-friendly version, here are other implementations.
Last updated February 17th, 2020.