Some integer factorization algorithms using elliptic curves

Some integer factorization algorithms using elliptic curves (1986)

by Richard P. Brent

Venue:	Australian Computer Science Communications
Citations:	41 - 13 self

Datum	Value	Source
TITLE	Some integer factorization algorithms using elliptic curves	INFERENCE
AUTHOR NAME	Richard P. Brent	SVM HeaderParse 0.2
AUTHOR AFFIL	Computer Sciences Laboratory; Australian National University	SVM HeaderParse 0.2
ABSTRACT	Lenstra’s integer factorization algorithm is asymptotically one of the fastest known algorithms, and is also 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. 1	SVM HeaderParse 0.2
YEAR	1986	INFERENCE
VENUE	Australian Computer Science Communications	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	149--163	INFERENCE
VOLUME	8	INFERENCE
TECH	Also Report CMA-R32-85	INFERENCE
CITATIONS	30 found	ParsCit 1.0