Block Sieving Algorithms

Wambach, Georg and Wettig, Hannes (1995) Block Sieving Algorithms.
Technical Report , 9 p.

Abstract

Quite similiar to the Sieve of Erastosthenes, the best-known general algorithms for factoring large numbers today are memory-bounded processes. We develop three variations of the sieving phase and discuss them in detail. The fastest modification is tailored to RISC processors and therefore especially suited for modern workstations and massively parallel supercomputers. For a 116 decimal digit composite number we achieved a speedup greater than two on an IBM RS/6000 250 workstation.


Actions:
Download: [img] Postscript
Download (103Kb) | Preview
Export as:
Editorial actions: View Item View Item (Login required)
Deposit Information:
ZAIK Number: zpr95-190
Depositing User: Archive Admin
Date Deposited: 02 Apr 2001 00:00
Last Modified: 19 Jan 2012 11:05
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/190