5 citations · 6 across the 4 of their papers we have counts for
5 papers
Evaluation of Modular Polynomials from Supersingular Elliptic Curves
Maria Corte-Real Santos, Jonathan Komada Eriksen, Antonin Leroux +2
We present several new algorithms to evaluate modular polynomials of level modulo a prime on an input . More precisely, we introduce two new generic algorithms, shari…
Hidden Stabilizers, the Isogeny To Endomorphism Ring Problem and the Cryptanalysis of pSIDH
Mingjie Chen, Muhammad Imran, Gábor Ivanyos +3
The Isogeny to Endomorphism Ring Problem (IsERP) asks to compute the endomorphism ring of the codomain of an isogeny between supersingular curves in characteristic given only a…
Computation of Hilbert class polynomials and modular polynomials from supersingular elliptic curves
Antonin Leroux
We present several new heuristic algorithms to compute class polynomials and modular polynomials modulo a prime by revisiting the idea of working with supersingular elliptic cu…
Faster computation of isogenies of large prime degree
Daniel Bernstein, Luca de Feo, Antonin Leroux +1
Let be an elliptic curve, and a point in of prime order . Vélu's formulae let us compute a quotient curve $\mathcal…
Information gain ratio correction: Improving prediction with more balanced decision tree splits
Antonin Leroux, Matthieu Boussard, Remi Dès
Decision trees algorithms use a gain function to select the best split during the tree's induction. This function is crucial to obtain trees with high predictive accuracy. Some gai…