 |
|
| HAL: hal-00505799, version 1 |
| arXiv: 1002.2594 |
| DOI: 10.1016/j.jsc.2011.12.008 |
| Detailed view |  Export this paper |
 |
| Journal of Symbolic Computation 47, 7 (2012) 771-792 |
|
|
|
|
| Fast Arithmetics in Artin-Schreier Towers over Finite Fields |
|
|
| Luca De Feo 1, 2Éric Schost 3 |
|
|
| For the ECHEC collaboration(s) |
|
|
| (2012-07) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'informatique de l'école polytechnique (LIX) |
|
|
|
CNRS : UMR7161 – Polytechnique - X |
|
|
| 2: | TANC (INRIA Saclay - Ile de France) |
|
|
|
INRIA – Polytechnique - X – CNRS : UMR7161 |
|
|
| 3: | Department of Computer Science |
|
|
|
University of Western Ontario |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Symbolic Computation Computer Science/Mathematical Software |
|
|
| Algorithms – Complexity – Artin-Schreier |
|
|
|
| Fulltext link: |
|
| http://fr.arXiv.org/abs/1002.2594 |
| hal-00505799, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00505799 | |
| oai:hal.archives-ouvertes.fr:hal-00505799 | |
| From: Luca De Feo | |
| Submitted on: Monday, 26 July 2010 11:43:33 | |
| Updated on: Wednesday, 4 April 2012 13:54:41 | |
