Papers
Topics
Authors
Recent
Search
2000 character limit reached

Fast Arithmetics in Artin-Schreier Towers over Finite Fields

Published 12 Feb 2010 in cs.SC and cs.MS | (1002.2594v1)

Abstract: An Artin-Schreier tower over the finite field F_p is a tower of field extensions generated by polynomials of the form Xp - 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.

Citations (19)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.