Fast algorithms for ell-adic towers over finite fields
Symbolic Computation
2020-01-07 v1 Number Theory
Abstract
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 many cases, our algorithms have quasi-linear complexity.
Cite
@article{arxiv.1301.6021,
title = {Fast algorithms for ell-adic towers over finite fields},
author = {Luca De Feo and Javad Doliskani and Éric Schost},
journal= {arXiv preprint arXiv:1301.6021},
year = {2020}
}