Fast algorithms for ℓ-adic towers over finite fields

Luca de Feo 1 Javad Doliskani Eric Schost
1 PRISM - Parallélisme, Réseaux, Systèmes, Modélisation
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 ℓ-adic closure of a finite field. In many cases, our algorithms have quasi-linear complexity. Copyright 2013 ACM.
Keywords : Pell's equation Irreducible polynomials Finite fields Extension towers Elliptic curves Algebraic tori
Document type :
Conference papers
Complete list of metadatas
https://hal.uvsq.fr/hal-02177220
Contributor : Équipe Hal Uvsq <>
Submitted on : Monday, July 8, 2019 - 5:12:14 PM
Last modification on : Wednesday, July 10, 2019 - 1:30:33 AM

Identifiers

Collections

UVSQ | INSMI | PRISM

Citation

Luca de Feo, Javad Doliskani, Eric Schost. Fast algorithms for ℓ-adic towers over finite fields. 38th International Symposium on Symbolic and Algebraic Computation, ISSAC 2013, Jun 2013, Boston, MA, United States. pp.165-172, ⟨10.1145/2465506.2465956⟩. ⟨hal-02177220⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

12

Contact

CCSD