论文信息 - Block Sieving Algorithms Block Sieving Algorithms

Block Sieving Algorithms Block Sieving Algorithms

Quite similiar to the Sieve of Erastosthenes, the best-known general algorithms for fac-toring large numbers today are memory-bounded processes. We develop three variations of the sieving phase and discuss them in detail. The fastest modiication 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.

H. Wettig

[1] David A. Patterson,et al. Computer Architecture: A Quantitative Approach , 1969 .

[2] I. Pokamestov,et al. Factoring , 2010 .

[3] Carl Pomerance,et al. The Quadratic Sieve Factoring Algorithm , 1985, EUROCRYPT.

[4] Robert D. Silverman. The multiple polynomial quadratic sieve , 1987 .

[5] J. Pollard. The lattice sieve , 1993 .

[6] H. Lenstra,et al. Factoring integers with the number field sieve , 1993 .