16 citations · 57 across the 5 of their papers we have counts for
Showing cs.SCShow all
3 papers · 1 filter
cs.SC2017★ 9 cited
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…
cs.SC2013★ 10 cited
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…
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…