16 citations · 57 across the 5 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
math.NT2010★ 16 cited
Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic
Luca De Feo
The problem of computing an explicit isogeny between two given elliptic curves over F_q, originally motivated by point counting, has recently awaken new interest in the cryptology…
cs.SC2010★ 13 cited
Fast Arithmetics in Artin-Schreier Towers over Finite Fields
Luca De Feo, Éric Schost
An Artin-Schreier tower over the finite field F_p is a tower of field extensions generated by polynomials of the form X^p - X - a. Following Cantor and Couveignes, we give algorith…