Constructing elliptic curves of prime order

Details Constructing elliptic curves of prime order Constructing elliptic curves of prime order

2007-12-12

arxiv.org/abs/0712.2022v1

Mathematics

Number Theory

13 pages

Scientific paper

We present a very efficient algorithm to construct an elliptic curve E and a finite field F such that the order of the point group E(F) is a given prime number N. Heuristically, this algorithm only takes polynomial time Otilde((\log N)^3), and it is so fast that it may profitably be used to tackle the related problem of finding elliptic curves with point groups of prime order of prescribed size. We also discuss the impact of the use of high level modular functions to reduce the run time by large constant factors and show that recent gonality bounds for modular curves imply limits on the time reduction that can be obtained.

Affiliated with

Also associated with

No associations

Rating

Constructing elliptic curves of prime order 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 Constructing elliptic curves of prime order, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constructing elliptic curves of prime order will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-662248