Follow
Aurore Guillevic
Aurore Guillevic
Inria Nancy
Verified email at inria.fr - Homepage
Title
Cited by
Cited by
Year
Comparing the pairing efficiency over composite-order and prime-order elliptic curves
A Guillevic
International Conference on Applied Cryptography and Network Security, 357-372, 2013
1092013
Improving NFS for the discrete logarithm problem in non-prime finite fields
R Barbulescu, P Gaudry, A Guillevic, F Morain
Annual International Conference on the Theory and Applications of …, 2015
902015
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
F Boudot, P Gaudry, A Guillevic, N Heninger, E Thomé, P Zimmermann
Annual International Cryptology Conference, 62-91, 2020
422020
A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
A Guillevic
IACR international conference on public-key cryptography, 535-564, 2020
372020
Four-dimensional GLV via the Weil restriction
A Guillevic, S Ionica
International Conference on the Theory and Application of Cryptology and …, 2013
352013
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
322020
Algorithms for outsourcing pairing computation
A Guillevic, D Vergnaud
International Conference on Smart Card Research and Advanced Applications …, 2014
272014
Genus 2 hyperelliptic curve families with explicit jacobian order evaluation and pairing-friendly constructions
A Guillevic, D Vergnaud
International Conference on Pairing-Based Cryptography, 234-253, 2012
272012
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, 63-94, 2017
262017
On the alpha value of polynomials in the tower number field sieve algorithm
A Guillevic, S Singh
Mathematical Cryptology 1 (1), 1-39, 2021
252021
Optimized and secure pairing-friendly elliptic curves suitable for one layer proof composition
YE Housni, A Guillevic
International Conference on Cryptology and Network Security, 259-279, 2020
222020
Computing Individual Discrete Logarithms Faster in with the NFS-DL Algorithm
A Guillevic
International Conference on the Theory and Application of Cryptology and …, 2015
192015
Efficient multiplication in finite field extensions of degree 5
NE Mrabet, A Guillevic, S Ionica
International Conference on Cryptology in Africa, 188-205, 2011
162011
Discrete logarithms
A Guillevic, F Morain
Guide to pairing-based cryptography, 9-1-9-42, 2017
122017
Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
A Guillevic, F Morain, E Thomé
International Conference on Selected Areas in Cryptography, 559-578, 2016
122016
Faster individual discrete logarithms in finite fields of composite extension degree
A Guillevic
Mathematics of Computation 88 (317), 1273-1301, 2019
102019
Computing discrete logarithms in
L Grémy, A Guillevic, F Morain, E Thomé
Selected Areas in Cryptography–SAC 2017 10719, 85-105, 2017
102017
Arithmetic of pairings on algebraic curves for cryptography
A Guillevic
Ecole Normale Supérieure de Paris-ENS Paris, 2013
102013
A new family of pairing-friendly elliptic curves
M Scott, A Guillevic
International Workshop on the Arithmetic of Finite Fields, 43-57, 2018
92018
Discrete logarithms in GF (p2)—160 digits, 2014
R Barbulescu, P Gaudry, A Guillevic, F Morain
Announcement available at the NMBRTHRY archives, item 4706, 19, 0
9
The system can't perform the operation now. Try again later.
Articles 1–20