2020. Cocks-Pinch curves of embedding degrees five to eight and
optimal ate pairing computation. Aurore Guillevic, Simon Masson,
Emmanuel Thomé. Design, Codes and Cryptography, March 2020, 88, pp. 1047-1081.
DOI: 10.1007/s10623-020-00727-w,
HAL:02305051,
ePrint 2019:431.
2020. Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment.
Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann.
In D. Micciancio, T. Ristenpart, eds,
CRYPTO 2020,
August 17-20, 2020, Santa Barbara, CA. IACR, Springer, LNCS, 12171, pp. 62-91.
DOI: 10.1007/978-3-030-56880-1_3,
HAL:02863525,
ePrint 2020:691.
2016. Isogenies for point counting on genus two hyperelliptic
curves with maximal real multiplication.
Sean Ballentine, Aurore Guillevic, Elisa Lorenzo Garcia, Chloe Martindale,
Maike Massierer, Benjamin Smith, Jaap Top.
In E. W. Howe, K. E. Lauter, J. L. Walker, eds,
Algebraic Geometry for Coding Theory and Cryptography,
Feb 2016, UCLA, Los Angeles, CA, United States. Springer, AWMS 9, pp.63-94,
DOI: 10.1007/978-3-319-63931-4,
HAL:01421031.
2015. Computing Individual Discrete Logarithms Faster
in GF(pn) with the NFS-DL algorithm.
Aurore Guillevic.
Asiacrypt 2015,
Auckland, New Zealand, November 29-December 3, 2015, LNCS, Part I, volume 9452, pages 149-173.
DOI: 10.1007/978-3-662-48797-6_7,
HAL:01157378,
ePrint 2015:513.
2015.
Improving NFS for the discrete logarithm problem in non-prime finite fields.
Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic,
François Morain.
Eurocrypt 2015 (34th Annual International Conference on the
Theory and Applications of Cryptographic Techniques), Sofia,
Bulgaria , LNCS 9056, pp. 129-155.
DOI: 10.1007/978-3-662-46800-5_6,
HAL:01112879,
ePrint 2016:605.
2014. Algorithms for Outsourcing Pairing Computation.
Aurore Guillevic, Damien Vergnaud.
Cardis 2014 (Smart Card Research and Advanced Applications - 13th
International Conference), Paris, France, November 5-7, 2014.
Revised selected papers, LNCS 8968, pp.193--211.
DOI: 10.1007/978-3-319-16763-3_12,
HAL:01084550.
2013. Four dimensional GLV via the Weil
restriction. Aurore Guillevic, Sorina Ionica. ASIACRYPT
2013, Bengalore, India, LNCS 8269, pp. 79-96.
DOI: 10.1007/978-3-642-42033-7_5,
ePrint 2013:311.
2013. Comparing the Pairing Efficiency over
Composite-Order and Prime-Order Elliptic Curves.
Aurore Guillevic.
ACNS 2013, Banff, Alberta, Canada,
LNCS 7954, pp. 357-372.
DOI: 10.1007/978-3-642-38980-1_22,
ePrint 2013:218
2012. Improved Broadcast Encryption Scheme with
Constant-Size Ciphertext. Renaud Dubois, Aurore Guillevic,
Marine Sengelin Le Breton. Pairing 2012, Cologne, Germany,
LNCS 7708, pp. 196-202.
DOI: 10.1007/978-3-642-36334-4_12,
ePrint 2012:370
2012. Genus 2 Hyperelliptic Curve Families with
Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions.
Aurore Guillevic, Damien Vergnaud.
Pairing 2012, Cologne, Germany, LNCS 7708, pp. 234-253.
DOI: 10.1007/978-3-642-36334-4_16,
ePrint 2011:604.
2011. Efficient Multiplication in Finite Field
Extensions of Degree 5. Nadia El Mrabet, Aurore Guillevic,
Sorina Ionica. AFRICACRYPT 2011, Dakar, Senegal, LNCS 6737,
pp. 188-205.
DOI: 10.1007/978-3-642-21969-6_12.
Chapter in book
2016. Pairings for Engineers, chapter 9 - Discrete Logarithms.
Aurore Guillevic, François Morain. N. ElMrabet, M. Joye (eds), pp. 203-242.
CRC Press Taylor and Francis group, Spring 2016.
Hardcover book,
HAL:01420485.
Preprints
2020. Optimized and secure pairing-friendly elliptic curves suitable for one layer proof composition.
Youssef El Housni, Aurore Guillevic.
ePrint:2020/351.
2019. On the alpha value of polynomials in the tower number field
sieve algorithm. Aurore Guillevic, Shashank Singh.
HAL:02263098,
ePrint:2019/885.
2017. Breaking DLP in GF(p5) using 3-dimensional sieving.
Laurent Grémy, Aurore Guillevic, François Morain.
HAL:01568373.
2014. Improvements to the Number Field Sieve for Non-Prime Finite Fields.
Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain.
HAL:01052449
2013. Golden Sequence for the PPSS Broadcast Encryption Scheme with an Asymmetric Pairing.
Renaud Dubois, Margaux Dugardin, Aurore Guillevic.
ePrint 2013:477.
NMBRTHY announcements
2019. 795-bit factoring and discrete logarithms.
F. Boudot, P. Gaudry, A. Guillevic, N. Heninger, E. Thomé, P. Zimmermann.
NMBRTHY list, Dec 2019.
link.
2017. Discrete logarithm record computation in
GF(p5) of 100 decimal digits using NFS with 3-dimensional sieving.
L. Grémy, A. Guillevic, F. Morain.
NMBRTHRY list, August 2017.
link.
2016. Breaking a DLP on a 170-bit n=3 MNT curve.
A. Guillevic, F. Morain, E. Thomé.
NMBRTHRY list, June 2016.
link.
2014. Discrete logarithms in GF(p2) - 160 digits.
R. Barbulescu, P. Gaudry, A. Guillevic, F. Morain.
NMBRTHRY list, June 2014.
link.
Thesis
2013. Arithmetic of pairings on algebraic curves for cryptography
(Etude de l'arithmétique des couplages sur les courbes algébriques pour la cryptographie).
December 20, 2013.
Thesis and slides of the defense on TEL archive
TEL:00921940.