Copyright © 1995 Academic Press, Inc. All rights reserved.
Regular Article
Counting the Integers Factorable via Cyclotomic Methods
Available online 30 April 2002.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
Let F(x, t, A) denote the number of integers up to x that algorithm A can completely factor with probability at least 1/2 using at most t arithmetic operations with integers at most x. In this paper we analyze F(x, t, A) for the p − 1 and p + 1 integer factoring algorithms based on the first two cyclotomic polynomials. We show that the p ± 1 algorithms each factor a positive proportion more integers in t steps than trial division but far fewer than the elliptic curve method.






E-mail Article
Add to my Quick Links



(α)
1−α−
(1/α) 



