Finding ECM-Friendly Curves through a Study of Galois Properties. - Razvan Barbulescu; Joppe W. Bos; Cyril Bouvier; Thorsten Kleinjung; Peter L. Montgomery (IACR Cryptol. ePrint Arch., 2012)

Discrete logarithm in GF(2809) with FFS. - Razvan Barbulescu; Cyril Bouvier; Jérémie Detrey; Pierrick Gaudry; Hamza Jeljeli; Emmanuel Thomé; Marion Videau; Paul Zimmermann (IACR Cryptol. ePrint Arch., 2013)

Discrete Logarithm in GF(2809) with FFS. - Razvan Barbulescu; Cyril Bouvier; Jérémie Detrey; Pierrick Gaudry; Hamza Jeljeli; Emmanuel Thomé; Marion Videau; Paul Zimmermann (Public Key Cryptography, 2014)

Division-Free Binary-to-Decimal Conversion. - Cyril Bouvier; Paul Zimmermann (IEEE Trans. Computers, 2014)

Algorithmes pour la factorisation d'entiers et le calcul de logarithme discret. (Algorithms for integer factorization and discrete logarithms computation). - Cyril Bouvier (2015)

Better polynomials for GNFS. - Shi Bai 001; Cyril Bouvier; Alexander Kruppa; Paul Zimmermann (Math. Comput., 2016)

Faster cofactorization with ECM using mixed representations. - Cyril Bouvier; Laurent Imbert (IACR Cryptol. ePrint Arch., 2018)

An Alternative Approach for SIDH Arithmetic. - Cyril Bouvier; Laurent Imbert (IACR Cryptol. ePrint Arch., 2020)

I Want to Ride My BICYCL : BICYCL Implements CryptographY in CLass Groups. - Cyril Bouvier; Guilhem Castagnos; Laurent Imbert; Fabien Laguillaumie (J. Cryptol., 2023)