Conference rusure::math

433.0. "New book on factoring" by TOOLS::STAN () Tue Jan 21 1986 12:10

I heartily recommend the following book:

Hans Riesel, Prime Numbers and Computer Methods for Factorization.
	Birkhauser, Boston: 1985. 464 pp.   ISBN: 0-8176-3291-3.

There are 6 chapters:

The Number of Primes Below a Given Limit
The Primes Viewed at Large
Subtleties in the Distribution of Primes
The Recognition of Primes
Factorization
Prime Numbers and Cryptography

plus 9 appendices covering all the mathematics needed to read the book.

There are also a large number of tables for record factorizations of
numbers of various forms.

The best thing about this book is that it is reasonably up-to-date.
(I estimate that it is less than 2 years out-of-date.)   It also includes
many programs (or program skeletons), written in PASCAL, for the
various factoring algorithms.  A multiprecision integer arithmetic
package (in PASCAL) is included, in case you don't already have one.

Some of the factoring algorithms described are:

Trial Division
Fermat's Method
Pollard's p-1 Method
Pollard's rho Method
Shanks method (SQUFOF)
Morrison and Brillhart's Continued Fraction Method
The Quadratic Sieve
Schroeppel's Method
The Schnorr-Lenstra Method