"Theorems on factorization and primality testing" Reference request

Question

I would like to ask two questions :

1. Is John M. Pollard's 1974 paper Theorems of factorization and primality testing available online for free ?
2. Independently of that : where can I find the material distilled nicely in textbook form ? Or in a nice expository paper ?

Thank you !

Answer 1

Pollard's 1974 paper seems to be what is described in Wikipedia under Pollard's $p − 1$ algorithm.

Try also these books:

• Factorization and Primality Testing by Bressoud.

• Primality Testing in Polynomial Time by Dietzfelbinger.

• Primality Testing for Beginners by Rempe-Gillen and Waldecker.

• The Joy of Factoring by Wagstaff.

• Prime Numbers: A Computational Perspective by Crandall and Pomerance.

• Prime Numbers and Computer Methods for Factorization by Riesel.

See also the survey It is easy to determine whether a given integer is prime by Granville.