16 citations · 57 across the 5 of their papers we have counts for
5 papers
Computing isomorphisms and embeddings of finite fields
Ludovic Brieulle, Luca De Feo, Javad Doliskani +2
Let be a finite field. Given two irreducible polynomials over , with dividing , the finite field embedding probl…
Explicit isogenies in quadratic time in any characteristic
Luca De Feo, Cyril Hugounenq, Jérôme Plût +1
Consider two elliptic curves defined over the finite field , and suppose that there exists an isogeny between and . We propose an algorithm that de…
Fast algorithms for ell-adic towers over finite fields
Luca De Feo, Javad Doliskani, Éric Schost
Inspired by previous work of Shoup, Lenstra-De Smit and Couveignes-Lercier, we give fast algorithms to compute in (the first levels of) the ell-adic closure of a finite field. In m…
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…
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…