Alexandre Gélin

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

On the complexity of class group computations for large degree number fields.
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).
PhD thesis, 2017

Loop-abort faults on supersingular isogeny cryptosystems.
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.
IACR Cryptol. ePrint Arch., 2017

Computing Generator in Cyclotomic Integer Rings - A Subfield Algorithm for the Principal Ideal Problem in L<sub>|Δ𝕂|</sub>(½) and Application to the Cryptanalysis of a FHE Scheme.
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
Parametrizations for Families of ECM-friendly curves.
IACR Cryptol. ePrint Arch., 2016

Reducing number field defining polynomials: An application to class group computations.
IACR Cryptol. ePrint Arch., 2016

Computing generator in cyclotomic integer rings.
IACR Cryptol. ePrint Arch., 2016


  Loading...