1. Brillhart, J., Lehmer, D.H., Selfridge, J.L., Tuckerman, B., and Wagstaff, S.S. Jr. 1983. Factorizations of b n ± 1 for b = 2, 3, 5, 6, 7, 10, 11, 12, up to High Powers. American Mathematical Society, Providence, Rhode Island.
2. Coppersmith, D., Odlyzko, A.M., and Schroeppel, R. 1986. Discrete logarithms in GF(p). Algorithmica, 1: 1?15.
3. Davis, J.A., and Holdridge, D.B. 1983. Factorization using the quadratic sieve algorithm. Sandia National Laboratories Tech. Rept. SAND 83-1346.
4. Davis, J.A., Holdridge, D.B., and Simmons, G.J. 1985. Status report on factoring. Advances in Cryptology: Lecture Notes in Computer Science, pp 183?215.
5. Knuth, D.E. 1981. The Art of Computer Programming, vol. 2, Seminumerical Algorithms, 2nd ed. Addison-Wesley, Reading, Massachusetts, p. 365.