ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Journal of Algorithms
Volume 19, Issue 2, September 1995, Pages 250-265
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (550 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
doi:10.1006/jagm.1995.1036    How to Cite or Link Using DOI (Opens New Window)
Copyright © 1995 Academic Press, Inc. All rights reserved.

Regular Article

Counting the Integers Factorable via Cyclotomic Methods

Pomerance C. and Sorenson J.

Univ Georgia, Dept Math, Athens, GA 30602, USA and Butler Univ, Dept Math & Comp Sci, Indianapolis, IN 46208, USA

Available online 30 April 2002.

Purchase the full-text article



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.


Journal of Algorithms
Volume 19, Issue 2, September 1995, Pages 250-265
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.