Fast algorithms for ell-adic towers over finite fields

CoRR, 2013.

Cited by: 0|Bibtex|Views1|Links
EI

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.

Code:

Data:

Your rating :
0

 

Tags
Comments