16158 articles – 32635 references  [version française]
HAL: hal-00505799, version 1

Short view  Export this paper
Fast Arithmetics in Artin-Schreier Towers over Finite Fields
De Feo L., Schost E.
Journal of Symbolic Computation 47, 7 (2012) 771-792 - http://hal.archives-ouvertes.fr/hal-00505799
Article in peer-reviewed journal
Computer Science/Symbolic Computation
Computer Science/Mathematical Software
Fast Arithmetics in Artin-Schreier Towers over Finite Fields
Luca De Feo () 1, 2, Éric Schost 3
1:  Laboratoire d'informatique de l'école polytechnique (LIX)
http://www.lix.polytechnique.fr/
CNRS : UMR7161 – Polytechnique - X
Route de Saclay 91128 PALAISEAU CEDEX
France
2:  TANC (INRIA Saclay - Ile de France)
INRIA – Polytechnique - X – CNRS : UMR7161
LIX
France
3:  Department of Computer Science
http://www.csd.uwo.ca/
University of Western Ontario
Middlesex College, The University of Western Ontario, London, Ontario, Canada, N6A 5B7
Canada
An Artin-Schreier tower over the finite field F_p is a tower of field extensions generated by polynomials of the form X^p - X - a. Following Cantor and Couveignes, we give algorithms with quasi-linear time complexity for arithmetic operations in such towers. As an application, we present an implementation of Couveignes' algorithm for computing isogenies between elliptic curves using the p-torsion.
English
2010-02-12

Journal of Symbolic Computation
Publisher Elsevier
ISSN 0747-7171 (eISSN : 1095-855X)
international
2012-07
47
7
771-792

Algorithms – Complexity – Artin-Schreier

ECHEC
Fulltext link: 
http://fr.arXiv.org/abs/1002.2594