Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic

Details Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic

2010-02-12

arxiv.org/abs/1002.2597v1

Mathematics

Number Theory

21 pages, 6 figures, 1 table. Submitted to J. Number Theory

Scientific paper

The problem of computing an explicit isogeny between two given elliptic curves over F_q, originally motivated by point counting, has recently awaken new interest in the cryptology community thanks to the works of Teske and Rostovstev & Stolbunov. While the large characteristic case is well understood, only suboptimal algorithms are known in small characteristic; they are due to Couveignes, Lercier, Lercier & Joux and Lercier & Sirvent. In this paper we discuss the differences between them and run some comparative experiments. We also present the first complete implementation of Couveignes' second algorithm and present improvements that make it the algorithm having the best asymptotic complexity in the degree of the isogeny.

Affiliated with

Also associated with

No associations

Rating

Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-420599