Computing generator in cyclotomic integer rings. - Thomas Espitau; Pierre-Alain Fouque; Alexandre Gélin; Paul Kirchner (IACR Cryptol. ePrint Arch., 2016)

Parametrizations for Families of ECM-friendly curves. - Alexandre Gélin; Thorsten Kleinjung; Arjen K. Lenstra (IACR Cryptol. ePrint Arch., 2016)

Reducing number field defining polynomials: an application to class group computations. - Alexandre Gélin; Antoine Joux (LMS J. Comput. Math., 2016)

Computing Generator in Cyclotomic Integer Rings - A Subfield Algorithm for the Principal Ideal Problem in L|Δ𝕂|(½) and Application to the Cryptanalysis of a FHE Scheme. - Jean-François Biasse; Thomas Espitau; Pierre-Alain Fouque; Alexandre Gélin; Paul Kirchner (EUROCRYPT (1), 2017)

Computing generator in cyclotomic integer rings, A subfield algorithm for the Principal Ideal Problem in L(1/2) and application to cryptanalysis of a FHE scheme. - Jean-François Biasse; Thomas Espitau; Pierre-Alain Fouque; Alexandre Gélin; Paul Kirchner (IACR Cryptol. ePrint Arch., 2017)

Loop-abort faults on supersingular isogeny cryptosystems. - Alexandre Gélin; Benjamin Wesolowski (IACR Cryptol. ePrint Arch., 2017)

Class Group Computations in Number Fields and Applications to Cryptology. (Calcul de Groupes de Classes d'un Corps de Nombres et Applications à la Cryptologie). - Alexandre Gélin (2017)

On the complexity of class group computations for large degree number fields. - Alexandre Gélin (CoRR, 2018)

Reducing the complexity for class group computations using small defining polynomials. - Alexandre Gélin (CoRR, 2018)