Aurore Guillevic
Aurore Guillevic
Inria Nancy
Bestätigte E-Mail-Adresse bei - Startseite
Zitiert von
Zitiert von
Comparing the pairing efficiency over composite-order and prime-order elliptic curves
A Guillevic
Applied Cryptography and Network Security: 11th International Conference …, 2013
Improving NFS for the discrete logarithm problem in non-prime finite fields
R Barbulescu, P Gaudry, A Guillevic, F Morain
Advances in Cryptology--EUROCRYPT 2015: 34th Annual International Conference …, 2015
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
F Boudot, P Gaudry, A Guillevic, N Heninger, E Thomé, P Zimmermann
Advances in Cryptology–CRYPTO 2020: 40th Annual International Cryptology …, 2020
A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
A Guillevic
Public-Key Cryptography–PKC 2020: 23rd IACR International Conference on …, 2020
Cocks–Pinch curves of embedding degrees five to eight and optimal ate pairing computation
A Guillevic, S Masson, E Thomé
Designs, Codes and Cryptography 88 (6), 1047-1081, 2020
Four-dimensional GLV via the Weil restriction
A Guillevic, S Ionica
Advances in Cryptology-ASIACRYPT 2013: 19th International Conference on the …, 2013
On the alpha value of polynomials in the tower number field sieve algorithm
A Guillevic, S Singh
Mathematical Cryptology 1 (1), 1-39, 2021
Optimized and secure pairing-friendly elliptic curves suitable for one layer proof composition
Y El Housni, A Guillevic
Cryptology and Network Security: 19th International Conference, CANS 2020 …, 2020
Algorithms for outsourcing pairing computation
A Guillevic, D Vergnaud
Smart Card Research and Advanced Applications: 13th International Conference …, 2015
Genus 2 hyperelliptic curve families with explicit jacobian order evaluation and pairing-friendly constructions
A Guillevic, D Vergnaud
Pairing-Based Cryptography–Pairing 2012: 5th International Conference …, 2013
Isogenies for point counting on genus two hyperelliptic curves with maximal real multiplication
S Ballentine, A Guillevic, EL García, C Martindale, M Massierer, B Smith, ...
Algebraic Geometry for Coding Theory and Cryptography: IPAM, Los Angeles, CA …, 2017
Computing individual discrete logarithms faster in with the NFS-DL algorithm
A Guillevic
International Conference on the Theory and Application of Cryptology and …, 2015
Efficient multiplication in finite field extensions of degree 5
N El Mrabet, A Guillevic, S Ionica
Progress in Cryptology–AFRICACRYPT 2011: 4th International Conference on …, 2011
Faster individual discrete logarithms in finite fields of composite extension degree
A Guillevic
Mathematics of Computation 88 (317), 1273-1301, 2019
Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
A Guillevic, F Morain, E Thomé
Selected Areas in Cryptography–SAC 2016: 23rd International Conference, St …, 2017
Computing discrete logarithms in
L Grémy, A Guillevic, F Morain, E Thomé
Selected Areas in Cryptography–SAC 2017 10719, 85-105, 2017
Discrete logarithms
A Guillevic, F Morain
Guide to pairing-based cryptography, 9-1-9-42, 2017
A survey of elliptic curves for proof systems
DF Aranha, Y El Housni, A Guillevic
Designs, Codes and Cryptography, 1-46, 2022
A new family of pairing-friendly elliptic curves
M Scott, A Guillevic
Arithmetic of Finite Fields: 7th International Workshop, WAIFI 2018, Bergen …, 2018
Families of SNARK-friendly 2-chains of elliptic curves
Y El Housni, A Guillevic
Advances in Cryptology–EUROCRYPT 2022: 41st Annual International Conference …, 2022
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20