1. Adleman, L. and M.-D. Huang, “Recognizing primes in random polynomial time”, presented at CRYPTO 86, 1986.
2. Adleman, L., C. Pomerance and R. Rumeley, “On distinguishing prime numbers from composite numbers”, Annals of Mathematics, vol. 117, pp. 173–206, 1983.
3. Babai, L., “Monte Carlo algorithms in graph isomorphism testing”, Rapport de Recherches du Département de Mathématiques et de Statistiques, Université de Montréal, D.M.S. #79-10, 1979.
4. Brassard, G. and P. Bratley, Introduction to Algorithmics, Prentice-Hall, Englewood Cliffs, New Jersey, to appear.
5. Couvreur, C. and J. J. Quisquater, “An introduction to fast generation of large prime numbers”, Philips Journal of Research, vol. 37, nos. 5/6, pp. 231–264, 1982.