Alexandre Gélin

According to our database, Alexandre Gélin authored at least 9 papers between 2016 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2018

Reducing the complexity for class group computations using small defining polynomials.

Alexandre Gélin

CoRR, 2018

On the complexity of class group computations for large degree number fields.

Alexandre Gélin

CoRR, 2018

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

PhD thesis, 2017

Loop-abort faults on supersingular isogeny cryptosystems.

Alexandre Gélin, Benjamin Wesolowski

IACR Cryptol. ePrint Arch., 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

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

Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

2016

Reducing number field defining polynomials: an application to class group computations.

Alexandre Gélin, Antoine Joux

LMS J. Comput. Math., 2016

Parametrizations for Families of ECM-friendly curves.

Alexandre Gélin, Thorsten Kleinjung, Arjen K. Lenstra

IACR Cryptol. ePrint Arch., 2016

Computing generator in cyclotomic integer rings.

Thomas Espitau, Pierre-Alain Fouque, Alexandre Gélin, Paul Kirchner

IACR Cryptol. ePrint Arch., 2016