Aurore Guillevic

Email : aurore guillevic [] inria fr


Journal papers

International conferences

  1. 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.
  2. 2020. A short-list of pairing-friendly curves resistant to Special TNFS at the 128-bit security level. Aurore Guillevic. In Aggelos Kiayias, Markulf Kohlweiss, Petros Wallden, Vassilis Zikas, eds, IACR International Conference on Practice and Theory of Public-Key Cryptography (PKC), May 2020, Edinburgh, Scotland. IACR, Springer, LNCS, 12111, pp. 535-564. DOI: 10.1007/978-3-030-45388-6_19, HAL:02396352, ePrint 2019:1371.
  3. 2018. A New Family of Pairing-Friendly elliptic curves. Michael Scott, Aurore Guillevic. In Lilya Budaghyan, Francisco Rodriguez-Henríquez, eds, International Workshop on the Arithmetic of Finite Fields – WAIFI, Jun 2018, Bergen, Norway. Springer, 11321, pp.43-57, 2018, LNCS. DOI: 10.1007/978-3-030-05153-2_2, HAL:01875361, ePrint 2018:193.
  4. 2017. Computing discrete logarithms in GF(p6). Laurent Grémy, Aurore Guillevic, François Morain, Emmanuel Thomé In Carlisle Adams, Jan Camenisch, eds, 24th Annual Conference on Selected Areas in Cryptography, Aug 2017, Ottawa, Canada. Springer, LNCS, 10719, pp.85-105, 2017. DOI: 10.1007/978-3-319-72565-9_5, HAL:01624662.
  5. 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.
  6. 2016. Solving discrete logarithms on a 170-bit MNT curve by pairing reduction. Aurore Guillevic, François Morain, Emmanuel Thomé. Selected Areas in Cryptography (SAC) 2016, St. John's, Newfoundland, Canada, August 10-12, 2016, Springer, LNCS, 10532, pp.559-578, 2018. DOI: 10.1007/978-3-319-69453-5_30, HAL:01320496, ePrint 2016:507, Slides.
  7. 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.
  8. 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.
  9. 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.
  10. 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.
  11. 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
  12. 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
  13. 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.
  14. 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


NMBRTHY announcements


Last updated February 17th, 2020.