Fast algorithms for ℓ-adic towers over finite fields - Université de Versailles Saint-Quentin-en-Yvelines
Conference Papers Year : 2013

Fast algorithms for ℓ-adic towers over finite fields

Luca de Feo
  • Function : Author
Parallélisme, Réseaux, Systèmes, Modélisation
Javad Doliskani
  • Function : Author
Eric Schost
  • Function : Author

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.

Domains

Mathematics [math]

Équipe HAL UVSQ  : Connect in order to contact the contributor

https://hal.uvsq.fr/hal-02177220

Submitted on : Monday, July 8, 2019-5:12:14 PM

Last modification on : Monday, April 8, 2024-1:21:49 PM

Consult the full text

Dates and versions

hal-02177220 , version 1 (08-07-2019)

Identifiers

Cite

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 XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS UVSQ
19 View
0 Download

Altmetric

Share

More