Comparing the pairing efficiency over composite-order and prime-order elliptic curves A Guillevic Applied Cryptography and Network Security: 11th International Conference …, 2013 | 127 | 2013 |
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 | 95 | 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 | 77 | 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 | 47 | 2020 |
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 | 47 | 2020 |
Four-dimensional GLV via the Weil restriction A Guillevic, S Ionica International Conference on the Theory and Application of Cryptology and …, 2013 | 35 | 2013 |
Optimized and secure pairing-friendly elliptic curves suitable for one layer proof composition Y El Housni, A Guillevic International Conference on Cryptology and Network Security, 259-279, 2020 | 34 | 2020 |
On the alpha value of polynomials in the tower number field sieve algorithm A Guillevic, S Singh Mathematical Cryptology 1 (1), 1-39, 2021 | 32 | 2021 |
Algorithms for outsourcing pairing computation A Guillevic, D Vergnaud Smart Card Research and Advanced Applications: 13th International Conference …, 2015 | 30 | 2015 |
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 | 28 | 2012 |
A survey of elliptic curves for proof systems DF Aranha, Y El Housni, A Guillevic Designs, Codes and Cryptography 91 (11), 3333-3378, 2023 | 25 | 2023 |
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 | 25 | 2017 |
Families of SNARK-friendly 2-chains of elliptic curves Y El Housni, A Guillevic Annual International Conference on the Theory and Applications of …, 2022 | 22 | 2022 |
Computing individual discrete logarithms faster in with the NFS-DL algorithm A Guillevic International Conference on the Theory and Application of Cryptology and …, 2015 | 21 | 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 | 21 | 2011 |
The state of the art in integer factoring and breaking public-key cryptography F Boudot, P Gaudry, A Guillevic, N Heninger, E Thomé, P Zimmermann IEEE Security & Privacy 20 (2), 80-86, 2022 | 15 | 2022 |
Faster individual discrete logarithms in finite fields of composite extension degree A Guillevic Mathematics of computation 88 (317), 1273-1301, 2019 | 14 | 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 | 14 | 2017 |
A new family of pairing-friendly elliptic curves M Scott, A Guillevic Arithmetic of Finite Fields: 7th International Workshop, WAIFI 2018, Bergen …, 2018 | 13 | 2018 |
Computing discrete logarithms in L Grémy, A Guillevic, F Morain, E Thomé Selected Areas in Cryptography–SAC 2017 10719, 85-105, 2017 | 13 | 2017 |