Efficiently computable endomorphisms for hyperelliptic curves

Details Efficiently computable endomorphisms for hyperelliptic curves Efficiently computable endomorphisms for hyperelliptic curves

2006-03-21

arxiv.org/abs/math/0603505v1

Mathematics

Number Theory

15 pages, LaTeX with xy-pic and algorithmicx packages. To appear in the proceedings of the 7th Algorithmic Number Theory Sympo

Scientific paper

Elliptic curves have a well-known and explicit theory for the construction and application of endomorphisms, which can be applied to improve performance in scalar multiplication. Recent work has extended these techniques to hyperelliptic Jacobians, but one obstruction is the lack of explicit models of curves together with an efficiently computable endomorphism. In the case of hyperelliptic curves there are limited examples, most methods focusing on special CM curves or curves defined over a small field. In this article we describe three infinite families of curves which admit an efficiently computable endomorphism, and give algorithms for their efficient application.

Affiliated with

Also associated with

No associations

Rating

Efficiently computable endomorphisms for hyperelliptic curves 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 Efficiently computable endomorphisms for hyperelliptic curves, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficiently computable endomorphisms for hyperelliptic curves will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-302513