Email : aurore guillevic [] inria fr
I am a research scientist (chargée de recherche) in the Caramba
team at Inria Nancy Grand Est, in France.
I am interested in pairing-based cryptography, discrete logarithm computation in
large characteristic finite fields, and computational number theory.
In 2016 I was a
PIMS-CNRS
postdoctoral fellow in the Computer Science
department of the University of Calgary (in Canada), working on computational
number theory and cryptography with
Pr. Michael Jacobson.
In 2014 and 2015 I was a post-doctoral researcher in
the Inria GRACE Team and CRYPTO LIX
Group. I contributed to discrete logarithm computation in
large characteristic finite fields. I worked with Razvan
Barbulescu, Pierrick Gaudry and François Morain on
the ANR Catrel
Project (together with the Caramel Team of Nancy and the
ARITH team of Montpellier).
I defended my PhD thesis on December, 20th, 2013. I received the
2014 Thales PhD Prize for this thesis. Each
year, the jury members select three nominees for this prize,
based on the research quality and the interest of industrial
applications. About 60 PhD thesis are defended each year at
Thales worldwide.
From 2011 to 2013 I was PhD student at ENS Crypto Team under the supervision
of
Damien Vergnaud. I was most of my time doing my research
at the Laboratoire Chiffre of Thales from which I had an
industrial grant.
You can find my PhD thesis on pairing
implementation here (in English, with an
introduction in French) as well as the slides of the defense (in
English).
The first chapter is an introduction on elliptic curves, pairings and
endomorphisms (constructed with isogenies) on elliptic
curves. The second chapter studies two families of genus two
curves. The third chapter is about pairing implementation. I
developed a library at Thales to compute Tate, ate and optimal
ate pairings on elliptic curves in large characteristic. I
focused on supersingular elliptic curves of embedding degree 2
and Barreto-Naehrig curves. (Sorry but the source code is not
freely available).