Aurore Guillevic

Orcid: 0000-0002-0824-7273

According to our database1, Aurore Guillevic authored at least 35 papers between 2011 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
An Algebraic Point of View on the Generation of Pairing-Friendly Curves.
SIAM J. Appl. Algebra Geom., 2025

2024
Embedded Curves and Embedded Families for SNARK-Friendly Curves.
IACR Cryptol. ePrint Arch., 2024

More Embedded Curves for SNARK-Pairing-Friendly Curves.
IACR Cryptol. ePrint Arch., 2024

A short-list of pairing-friendly curves resistant to the Special TNFS algorithm at the 192-bit security level.
IACR Commun. Cryptol., 2024

2022
The State of the Art in Integer Factoring and Breaking Public-Key Cryptography.
IEEE Secur. Priv., 2022

A survey of elliptic curves for proof systems.
IACR Cryptol. ePrint Arch., 2022

Families of SNARK-Friendly 2-Chains of Elliptic Curves.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

Co-factor Clearing and Subgroup Membership Testing on Pairing-Friendly Curves.
Proceedings of the Progress in Cryptology, 2022

2021
Automated fragment formula annotation for electron ionisation, high resolution mass spectrometry: application to atmospheric measurements of halocarbons.
J. Cheminformatics, 2021

Automated fragment identification for electron ionisation mass spectrometry: application to atmospheric measurements of halocarbons.
CoRR, 2021

2020
A Short-List of Pairing-Friendly Curves Resistant to Special TNFS at the 128-Bit Security Level.
Proceedings of the Public-Key Cryptography - PKC 2020, 2020

Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition.
Proceedings of the Cryptology and Network Security - 19th International Conference, 2020

2019
Faster individual discrete logarithms in finite fields of composite extension degree.
Math. Comput., 2019

On the alpha value of polynomials in the tower number field sieve algorithm.
IACR Cryptol. ePrint Arch., 2019

Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation.
IACR Cryptol. ePrint Arch., 2019

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

2018
A New Family of Pairing-Friendly Elliptic Curves.
Proceedings of the Arithmetic of Finite Fields - 7th International Workshop, 2018

2017
Isogenies for point counting on genus two hyperelliptic curves with maximal real multiplication.
CoRR, 2017

Computing Discrete Logarithms in 𝔽<sub>p<sup>6</sup></sub>.
Proceedings of the Selected Areas in Cryptography - SAC 2017, 2017

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

Solving Discrete Logarithms on a 170-Bit MNT Curve by Pairing Reduction.
Proceedings of the Selected Areas in Cryptography - SAC 2016, 2016

2015
Computing Individual Discrete Logarithms Faster in GF(p<sup>n)</sup>.
IACR Cryptol. ePrint Arch., 2015

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

Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

Computing Individual Discrete Logarithms Faster in GF(p n ) with the NFS-DL Algorithm.
Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014
Improvements to the number field sieve for non-prime finite fields.
CoRR, 2014

Algorithms for Outsourcing Pairing Computation.
Proceedings of the Smart Card Research and Advanced Applications, 2014

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

Golden Sequence for the PPSS Broadcast Encryption Scheme with an Asymmetric Pairing.
IACR Cryptol. ePrint Arch., 2013

Four-Dimensional GLV via the Weil Restriction.
Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

Comparing the Pairing Efficiency over Composite-Order and Prime-Order Elliptic Curves.
Proceedings of the Applied Cryptography and Network Security, 2013

2012
Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions.
Proceedings of the Pairing-Based Cryptography - Pairing 2012, 2012

Improved Broadcast Encryption Scheme with Constant-Size Ciphertext.
Proceedings of the Pairing-Based Cryptography - Pairing 2012, 2012

2011
Efficient Multiplication in Finite Field Extensions of Degree 5.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2011, 2011


  Loading...