Prime Numbers

REFERENCES 567
[Peralta and Okamoto 1996] R. Peralta and E. Okamoto. Faster factoring of
integers of a special form. IEICE Transactions on Fundamentals of
Electronics, Communications and Computer Sciences, E79-A:489–493,
1996.
[Percival 2003] C. Percival. Rapid multiplication modulo the sum and difference of
highly composite numbers. Math. Comp. 72:387–395, 2003.
[Peterson 2000] I. Peterson. Great computations. Science News, 157(10):152–153,
March 4, 2000.
[Pinch 1993] R. Pinch. The Carmichael numbers up to 10 15 . Math. Comp.,
61:381–391, 1993.
[Pollard 1974] J. Pollard. Theorems on factorization and primality testing. Proc.
Cambridge Philos. Soc., 76:521–528, 1974.
[Pollard 1975] J. Pollard. A Monte Carlo method for factorization. Nordisk
Tidskr. Informationsbehandling (BIT), 15:331–334, 1975.
[Pollard 1978] J. Pollard. Monte Carlo methods for index computation (mod p).
Math. Comp., 32:918–924, 1978.
[Pollard 2000] J. Pollard. Kangaroos, Monopoly and discrete logarithms. J.
Cryptology, 13:437–447, 2000.
[Pomerance 1981] C. Pomerance. On the distribution of pseudoprimes. Math.
Comp., 37:587–593, 1981.
[Pomerance 1982] C. Pomerance. Analysis and comparison of some integer
factoring algorithms. In H. Lenstra, Jr. and R. Tijdeman, editors,
Computational methods in number theory, Part I, volume 154 of Math.
Centre Tracts, pages 89–139. Math. Centrum, 1982.
[Pomerance 1985] C. Pomerance. The quadratic sieve factoring algorithm. In
Advances in cryptology, Proc. Eurocrypt ’84, volume 209 of Lecture Notes
in Computer Science, pages 169–182. Springer–Verlag, 1985.
[Pomerance 1986] C. Pomerance. On primitive divisors of Mersenne numbers.
Acta Arith., 46:355–367, 1986.
[Pomerance 1987a] C. Pomerance. Very short primality proofs. Math. Comp.,
48:315–322, 1987.
[Pomerance 1987b] C. Pomerance. Fast, rigorous factorization and discrete
logarithm algorithms. In Discrete Algorithms and Complexity, pages
119–143. Academic Press, 1987.
[Pomerance 1996a] C. Pomerance. Multiplicative independence for random
integers. In Analytic Number Theory, Vol. 2 (Allerton Park, IL, 1995),
volume 139 of Progr. Math., pages 703–711. Birkhäuser, 1996.
[Pomerance 1996b] C. Pomerance. A tale of two sieves. Notices Amer. Math. Soc.,
43:1473–1485, 1996.
[Pomerance and Smith 1992] C. Pomerance and J. Smith. Reduction of huge,
sparse matrices over finite fields via created catastrophes. Experiment.
Math., 1:89–94, 1992.