Some integer factorization algorithms using elliptic curves

Details Some integer factorization algorithms using elliptic curves Some integer factorization algorithms using elliptic curves

2010-04-20

arxiv.org/abs/1004.3366v1

Australian Computer Science Communications 8 (1986), 149-163

Mathematics

Number Theory

Corrected version of a paper that appeared in Australian Computer Science Communications 8 (1986), with postscript added 1998.

Scientific paper

Lenstra's integer factorization algorithm is asymptotically one of the fastest known algorithms, and is ideally suited for parallel computation. We suggest a way in which the algorithm can be speeded up by the addition of a second phase. Under some plausible assumptions, the speedup is of order log(p), where p is the factor which is found. In practice the speedup is significant. We mention some refinements which give greater speedup, an alternative way of implementing a second phase, and the connection with Pollard's "p-1" factorization algorithm.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-472048