Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

18

CORR
2006
Springer

favoriteEmaildiscussreport

114views Education» more CORR 2006»

Fast algorithms for computing isogenies between elliptic curves

13 years 6 months ago

Fast algorithms for computing isogenies between elliptic curves

Download www.csd.uwo.ca

We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an isogeny of degree ( different from the characteristic) in time quasi-linear with respect to . This is based in particular on fast algorithms for power series expansion of the Weierstrass -function and related functions.

Alin Bostan, Bruno Salvy, François Morain,

Real-time Traffic

Algorithms | CORR 2006 | Education | Elliptic Curves | Large Prime |

claim paper

Related Content

» A Subexponential Algorithm for Evaluating Large Degree Isogenies

» Fast Point Multiplication on Elliptic Curves through Isogenies

» Isogeny cordillera algorithm to obtain cryptographically good elliptic curves

» Constructing elliptic curve isogenies in quantum subexponential time

» Towards quantumresistant cryptosystems from supersingular elliptic curve isogenies

» Fast arithmetics in artinschreier towers over finite fields

» On the Optimal Parameter Choice for Elliptic Curve Cryptosystems Using Isogeny

» Descent via isogeny on elliptic curves with large rational torsion subgroups

» Computing modular polynomials in quasilinear time

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	CORR
Authors	Alin Bostan, Bruno Salvy, François Morain, Éric Schost

Comments (0)