Aurore Guillevic

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