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 | 109 | 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 | 90 | 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 Annual International Cryptology Conference, 62-91, 2020 | 42 | 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 | 37 | 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 |

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 | 32 | 2020 |

Algorithms for outsourcing pairing computation A Guillevic, D Vergnaud International Conference on Smart Card Research and Advanced Applications …, 2014 | 27 | 2014 |

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 | 27 | 2012 |

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 | 26 | 2017 |

On the alpha value of polynomials in the tower number field sieve algorithm A Guillevic, S Singh Mathematical Cryptology 1 (1), 1-39, 2021 | 25 | 2021 |

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 | 22 | 2020 |

Computing Individual Discrete Logarithms Faster in with the NFS-DL Algorithm A Guillevic International Conference on the Theory and Application of Cryptology and …, 2015 | 19 | 2015 |

Efficient multiplication in finite field extensions of degree 5 NE Mrabet, A Guillevic, S Ionica International Conference on Cryptology in Africa, 188-205, 2011 | 16 | 2011 |

Discrete logarithms A Guillevic, F Morain Guide to pairing-based cryptography, 9-1-9-42, 2017 | 12 | 2017 |

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 | 12 | 2016 |

Faster individual discrete logarithms in finite fields of composite extension degree A Guillevic Mathematics of Computation 88 (317), 1273-1301, 2019 | 10 | 2019 |

Computing discrete logarithms in L Grémy, A Guillevic, F Morain, E Thomé Selected Areas in Cryptography–SAC 2017 10719, 85-105, 2017 | 10 | 2017 |

Arithmetic of pairings on algebraic curves for cryptography A Guillevic Ecole Normale Supérieure de Paris-ENS Paris, 2013 | 10 | 2013 |

A new family of pairing-friendly elliptic curves M Scott, A Guillevic International Workshop on the Arithmetic of Finite Fields, 43-57, 2018 | 9 | 2018 |

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 | |