Aurore Guillevic

ORCID

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 31

Top Venues

IACR Cryptol. ePrint Arch.

CoRR

Des. Codes Cryptogr.

SAC

École Normale Supérieure, Paris, France (PHD)

Education History

École Normale Supérieure, Paris, France

PHD

Publications

Aurore Guillevic
More Embedded Curves for SNARK-Pairing-Friendly Curves. IACR Cryptol. ePrint Arch. 2024 (2024)
Diego F. Aranha, Georgios Fotiadis, Aurore Guillevic
A short-list of pairing-friendly curves resistant to the Special TNFS algorithm at the 192-bit security level. IACR Cryptol. ePrint Arch. 2024 (2024)
Diego F. Aranha, Youssef El Housni, Aurore Guillevic
A survey of elliptic curves for proof systems. Des. Codes Cryptogr. 91 (11) (2023)
Youssef El Housni, Aurore Guillevic
Families of SNARK-Friendly 2-Chains of Elliptic Curves. EUROCRYPT (2) (2022)
Youssef El Housni, Aurore Guillevic, Thomas Piellard
Co-factor Clearing and Subgroup Membership Testing on Pairing-Friendly Curves. AFRICACRYPT (2022)
Youssef El Housni, Aurore Guillevic, Thomas Piellard
Co-factor clearing and subgroup membership testing on pairing-friendly curves. IACR Cryptol. ePrint Arch. 2022 (2022)
Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann
The State of the Art in Integer Factoring and Breaking Public-Key Cryptography. IEEE Secur. Priv. 20 (2) (2022)
Diego F. Aranha, Youssef El Housni, Aurore Guillevic
A survey of elliptic curves for proof systems. IACR Cryptol. ePrint Arch. 2022 (2022)
Myriam Guillevic, Aurore Guillevic, Martin K. Vollmer, Paul Schlauri, Matthias Hill, Lukas Emmenegger, Stefan Reimann
Automated fragment formula annotation for electron ionisation, high resolution mass spectrometry: application to atmospheric measurements of halocarbons. J. Cheminformatics 13 (1) (2021)
Youssef El Housni, Aurore Guillevic
Families of SNARK-friendly 2-chains of elliptic curves. IACR Cryptol. ePrint Arch. 2021 (2021)
Myriam Guillevic, Aurore Guillevic, Martin Vollmer, Paul Schlauri, Matthias Hill, Lukas Emmenegger, Stefan Reimann
Automated fragment identification for electron ionisation mass spectrometry: application to atmospheric measurements of halocarbons. CoRR (2021)
Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment. IACR Cryptol. ePrint Arch. 2020 (2020)
Aurore Guillevic, Simon Masson, Emmanuel Thomé
Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation. Des. Codes Cryptogr. 88 (6) (2020)
Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann
Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment. CRYPTO (2) (2020)
Youssef El Housni, Aurore Guillevic
Optimized and secure pairing-friendly elliptic curves suitable for one layer proof composition. IACR Cryptol. ePrint Arch. 2020 (2020)
Youssef El Housni, Aurore Guillevic
Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition. CANS (2020)
Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment. CoRR (2020)
Aurore Guillevic
A Short-List of Pairing-Friendly Curves Resistant to Special TNFS at the 128-Bit Security Level. Public Key Cryptography (2) (2020)
Aurore Guillevic, Shashank Singh
On the alpha value of polynomials in the tower number field sieve algorithm. IACR Cryptol. ePrint Arch. 2019 (2019)
Aurore Guillevic, Simon Masson, Emmanuel Thomé
Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation. IACR Cryptol. ePrint Arch. 2019 (2019)
Aurore Guillevic
A short-list of STNFS-secure pairing-friendly curves at the 128-bit security level. IACR Cryptol. ePrint Arch. 2019 (2019)
Aurore Guillevic
Faster individual discrete logarithms in finite fields of composite extension degree. Math. Comput. 88 (317) (2019)
Aurore Guillevic
Faster individual discrete logarithms in finite fields of composite extension degree. CoRR (2018)
Michael Scott, Aurore Guillevic
A New Family of Pairing-Friendly Elliptic Curves. WAIFI (2018)
Sean Ballentine, Aurore Guillevic, Elisa Lorenzo García, Chloe Martindale, Maike Massierer, Benjamin Smith, Jaap Top
Isogenies for point counting on genus two hyperelliptic curves with maximal real multiplication. CoRR (2017)
Laurent Grémy, Aurore Guillevic, François Morain, Emmanuel Thomé
. SAC (2017)
Aurore Guillevic
Faster individual discrete logarithms in non-prime finite fields with the NFS and FFS algorithms. IACR Cryptol. ePrint Arch. 2016 (2016)
Aurore Guillevic, François Morain, Emmanuel Thomé
Solving discrete logarithms on a 170-bit MNT curve by pairing reduction. IACR Cryptol. ePrint Arch. 2016 (2016)
Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain
Improving NFS for the discrete logarithm problem in non-prime finite fields. IACR Cryptol. ePrint Arch. 2016 (2016)
Aurore Guillevic, François Morain, Emmanuel Thomé
Solving discrete logarithms on a 170-bit MNT curve by pairing reduction. CoRR (2016)
Aurore Guillevic, François Morain, Emmanuel Thomé
Solving Discrete Logarithms on a 170-Bit MNT Curve by Pairing Reduction. SAC (2016)
Aurore Guillevic
Computing Individual Discrete Logarithms Faster in GF(p^n). CoRR (2015)
Aurore Guillevic
Computing Individual Discrete Logarithms Faster in GF(p n ) with the NFS-DL Algorithm. ASIACRYPT (1) (2015)
Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain
Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields. EUROCRYPT (1) (2015)
Aurore Guillevic
. IACR Cryptol. ePrint Arch. 2015 (2015)
Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain
Improvements to the number field sieve for non-prime finite fields. CoRR (2014)
Aurore Guillevic, Damien Vergnaud
Algorithms for Outsourcing Pairing Computation. CARDIS (2014)
Renaud Dubois, Margaux Dugardin, Aurore Guillevic
Golden Sequence for the PPSS Broadcast Encryption Scheme with an Asymmetric Pairing. IACR Cryptol. ePrint Arch. 2013 (2013)
Aurore Guillevic, Sorina Ionica
Four-Dimensional GLV via the Weil Restriction. ASIACRYPT (1) (2013)
Aurore Guillevic
Comparing the Pairing Efficiency over Composite-Order and Prime-Order Elliptic Curves. ACNS (2013)
Aurore Guillevic
Comparing the Pairing Efficiency over Composite-Order and Prime-Order Elliptic Curves. IACR Cryptol. ePrint Arch. 2013 (2013)
Aurore Guillevic, Sorina Ionica
Four dimensional GLV via the Weil restriction. IACR Cryptol. ePrint Arch. 2013 (2013)
Aurore Guillevic, Damien Vergnaud
Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions. Pairing (2012)
Renaud Dubois, Aurore Guillevic, Marine Sengelin Le Breton
Improved Broadcast Encryption Scheme with Constant-Size Ciphertext. IACR Cryptol. ePrint Arch. 2012 (2012)
Renaud Dubois, Aurore Guillevic, Marine Sengelin Le Breton
Improved Broadcast Encryption Scheme with Constant-Size Ciphertext. Pairing (2012)
Aurore Guillevic, Damien Vergnaud
Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions. IACR Cryptol. ePrint Arch. 2011 (2011)
Nadia El Mrabet, Aurore Guillevic, Sorina Ionica
Efficient Multiplication in Finite Field Extensions of Degree 5. AFRICACRYPT (2011)

Aurore Guillevic.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Aurore Guillevic