Fast algorithms for l -adic towers over finite fields
Luca De Feo, Javad Doliskani, Éric Schost · 2013
Inspired by previous work of Shoup, Lenstra-De Smit and Couveignes-Lercier, we give fast algorithms to compute in the first levels of) the l-adic closure of a finite field. In many cases, our algorithms have quasi-linear complexity.