Skip to main content
Article thumbnail
Location of Repository

By 

Abstract

The latest and possibly fastest of the general factoringmethods for large compositenumbers is the quadratic sieve of Carl Pomerance. A variation of the algorithm is described and an implementationis suggestedwhich combines the forces of a fast pipeline computer such as the Cray I, and a high speed highly parallel array processor such as the Goodyear MPP. A runnin ~ time analysis,which is based on empirical data rather than asymptoticestimatas, suggests that this method co~ld be capable of factoring a 60 digit number in as little as 10 minutes and a 100 digit number is as little as 60 days of continuous computer time

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.5665
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://csdl.computer.org/comp/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.