Wambach, Georg and Wettig, Hannes (1995). Block Sieving Algorithms. ['eprint_fieldopt_monograph_type_preprint' not defined].

[thumbnail of zpr95-190.pdf]
Preview
 PDF
zpr95-190.pdf
Download (157kB) | Preview

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.

Item Type: Monograph (['eprint_fieldopt_monograph_type_preprint' not defined])
Creators:
Creators
Email
ORCID
ORCID Put Code
Wambach, Georg
UNSPECIFIED
UNSPECIFIED
UNSPECIFIED
Wettig, Hannes
UNSPECIFIED
UNSPECIFIED
UNSPECIFIED
URN: urn:nbn:de:hbz:38-546964
Date: 1995
Language: English
Faculty: Faculty of Mathematics and Natural Sciences
Divisions: Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science
Subjects: Data processing Computer science
Refereed: No
URI: http://kups.ub.uni-koeln.de/id/eprint/54696

Downloads

Downloads per month over past year

Export

Actions (login required)

View Item View Item