Fast algorithms for ℓ-adic towers over finite fields

de Feo, Luca
Doliskani, Javad
Schost, Eric

Open link

Publication date

June 2013

DOI

10.1145/2465506.2465956

Publisher

Association for Computing Machinery (ACM)

Abstract

International audienceInspired 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

Extracted data

We use cookies to provide a better user experience.

Data Protection

Fast algorithms for ℓ-adic towers over finite fields

Abstract

Extracted data

Fast algorithms for ℓ-adic towers over finite fields

Abstract

Extracted data

Related items

Related items