Sources for ISSAC '13 paper "Fast algorithms for l-adic towers over finite fields"
TeX Python Other
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
slides
Makefile
README.md
UNLICENSE
bench.dat
bench.mgm
bench.py
creat.gp
de_compose.py
defeo.bib
elliptic.py
mysymbols.sty
notes.tex
towers.tex
two_torus.py

README.md

Fast algorithms for ℓ-adic towers over finite fields

Authors: Luca De Feo, Javad Doliskani and É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 ℓ-adic closure of a finite field. In many cases, our algorithms have quasi-linear complexity.

Notice: this is the authors' version of a work that will be presented at the International Symposium on Symbolic and Algebraic Computation 2013 in Boston. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version will be subsequently published.

A preprint version is available at http://arxiv.org/abs/1301.6021.

The GitHub sources contain the LaTeX source code as well as the Sage scripts demonstrating the concepts involved.