1. L.M.Adleman, "On Distinguishing Primes from Composite Numbers" (Abstract), Proc. 21st Annual IEEE Symposium on Foundations of Computer Science, 1980, 387–406.
2. L.M.Adleman, R.Mcdonnell, "An Application of Higher Reciprocity to Computational Number Theory"(Abstract),Proc. 23rd Annual IEEE Symposium on Foundations of Computer Science, 1982, 100–106.
3. L.M. Adleman,C. Pomrerance,and R.S. Rumely, "On Distinguishing Primes from Composite Numbers", Annal of Math., 117(1983), 173–206.
4. A.V. Aho,J.E. Hopcroft, and J.D. Ullman, "The Design and Analysis of Algorithms", Addison-Wesley, Reading,MA 1974.
5. E.R. Berlekamp, "Factoring Polynomials over Large Finite Fields",Math. Comput.,24(1970),713–735.