Efficient Multiplication in Finite Field Extensions of Degree 5. - Nadia El Mrabet; Aurore Guillevic; Sorina Ionica (AFRICACRYPT, 2011)

Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions. - Aurore Guillevic; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2011)

Improved Broadcast Encryption Scheme with Constant-Size Ciphertext. - Renaud Dubois; Aurore Guillevic; Marine Sengelin Le Breton (IACR Cryptol. ePrint Arch., 2012)

Golden Sequence for the PPSS Broadcast Encryption Scheme with an Asymmetric Pairing. - Renaud Dubois; Margaux Dugardin; Aurore Guillevic (IACR Cryptol. ePrint Arch., 2013)

Comparing the Pairing Efficiency over Composite-Order and Prime-Order Elliptic Curves. - Aurore Guillevic (IACR Cryptol. ePrint Arch., 2013)

Four dimensional GLV via the Weil restriction. - Aurore Guillevic; Sorina Ionica (IACR Cryptol. ePrint Arch., 2013)

Arithmetic of pairings on algebraic curves for cryptography. (Étude de l'arithmétique des couplages sur les courbes algébriques pour la cryptographie). - Aurore Guillevic (2013)

Algorithms for Outsourcing Pairing Computation. - Aurore Guillevic; Damien Vergnaud (CARDIS, 2014)

Improvements to the number field sieve for non-prime finite fields. - Razvan Barbulescu; Pierrick Gaudry; Aurore Guillevic; François Morain (CoRR, 2014)

Computing Individual Discrete Logarithms Faster in GF(p n ) with the NFS-DL Algorithm. - Aurore Guillevic (ASIACRYPT (1), 2015)

Computing Individual Discrete Logarithms Faster in GF(p^n). - Aurore Guillevic (CoRR, 2015)

Computing Individual Discrete Logarithms Faster in GF(pn). - Aurore Guillevic (IACR Cryptol. ePrint Arch., 2015)

Improving NFS for the discrete logarithm problem in non-prime finite fields. - Razvan Barbulescu; Pierrick Gaudry; Aurore Guillevic; François Morain (IACR Cryptol. ePrint Arch., 2016)

Faster individual discrete logarithms in non-prime finite fields with the NFS and FFS algorithms. - Aurore Guillevic (IACR Cryptol. ePrint Arch., 2016)

Solving discrete logarithms on a 170-bit MNT curve by pairing reduction. - Aurore Guillevic; François Morain; Emmanuel Thomé (IACR Cryptol. ePrint Arch., 2016)

Computing Discrete Logarithms in 𝔽p6. - Laurent Grémy; Aurore Guillevic; François Morain; Emmanuel Thomé (SAC, 2017)

Isogenies for point counting on genus two hyperelliptic curves with maximal real multiplication. - Sean Ballentine; Aurore Guillevic; Elisa Lorenzo García; Chloe Martindale; Maike Massierer; Benjamin Smith 003; Jaap Top (CoRR, 2017)

A New Family of Pairing-Friendly Elliptic Curves. - Michael Scott; Aurore Guillevic (WAIFI, 2018)

A short-list of STNFS-secure pairing-friendly curves at the 128-bit security level. - Aurore Guillevic (IACR Cryptol. ePrint Arch., 2019)

On the alpha value of polynomials in the tower number field sieve algorithm. - Aurore Guillevic; Shashank Singh 001 (IACR Cryptol. ePrint Arch., 2019)

Faster individual discrete logarithms in finite fields of composite extension degree. - Aurore Guillevic (Math. Comput., 2019)

A Short-List of Pairing-Friendly Curves Resistant to Special TNFS at the 128-Bit Security Level. - Aurore Guillevic (Public Key Cryptography (2), 2020)

Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation. - Aurore Guillevic; Simon Masson; Emmanuel Thomé (Des. Codes Cryptogr., 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 (IACR Cryptol. ePrint Arch., 2020)

Optimized and secure pairing-friendly elliptic curves suitable for one layer proof composition. - Youssef El Housni; Aurore Guillevic (IACR Cryptol. ePrint Arch., 2020)

Automated fragment identification for electron ionisation mass spectrometry: application to atmospheric measurements of halocarbons. - Myriam Guillevic; Aurore Guillevic; Martin Vollmer; Paul Schlauri; Matthias Hill; Lukas Emmenegger; Stefan Reimann (CoRR, 2021)

Families of SNARK-friendly 2-chains of elliptic curves. - Youssef El Housni; Aurore Guillevic (IACR Cryptol. ePrint Arch., 2021)

Automated fragment formula annotation for electron ionisation, high resolution mass spectrometry: application to atmospheric measurements of halocarbons. - Myriam Guillevic; Aurore Guillevic; Martin K. Vollmer; Paul Schlauri; Matthias Hill; Lukas Emmenegger; Stefan Reimann (J. Cheminformatics, 2021)

Co-factor clearing and subgroup membership testing on pairing-friendly curves. - Youssef El Housni; Aurore Guillevic; Thomas Piellard (IACR Cryptol. ePrint Arch., 2022)

The State of the Art in Integer Factoring and Breaking Public-Key Cryptography. - Fabrice Boudot; Pierrick Gaudry; Aurore Guillevic; Nadia Heninger; Emmanuel Thomé; Paul Zimmermann (IEEE Secur. Priv., 2022)

A survey of elliptic curves for proof systems. - Diego F. Aranha; Youssef El Housni; Aurore Guillevic (Des. Codes Cryptogr., 2023)

A short-list of pairing-friendly curves resistant to the Special TNFS algorithm at the 192-bit security level. - Diego F. Aranha; Georgios Fotiadis; Aurore Guillevic (IACR Commun. Cryptol., 2024)

More Embedded Curves for SNARK-Pairing-Friendly Curves. - Aurore Guillevic (IACR Cryptol. ePrint Arch., 2024)

Embedded Curves and Embedded Families for SNARK-Friendly Curves. - Aurore Guillevic; Simon Masson (IACR Cryptol. ePrint Arch., 2024)

An Algebraic Point of View on the Generation of Pairing-Friendly Curves. - Jean Gasnier; Aurore Guillevic (SIAM J. Appl. Algebra Geom., 2025)