Fast algorithms for ell-adic towers over finite fields

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.

References in corpus (1)

• Conics - a Poor Man's Elliptic Curves

Cited by in corpus (2)

• Computing isomorphisms and embeddings of finite fields
• Standard Lattices of Compatibly Embedded Finite Fields