1. L. Adleman and M. Huang. Recognizing primes in random polynomial time. In Proceedings of the 19th ACM Symposium on Theory of Computing, pages 462–469. ACM Press, May 1987.
2. L. Adleman and M. Huang. Primality Testing and Abelian Varieties over Finite Fields. Springer-Verlag Lecture Notes in Mathematics #1512, Berlin, Heidelberg, New York, 1992.
3. M. Agrawal, N. Kayal, and N. Saxena. PRIMES is in P. Unpublished manuscript, August 2002.
4. D. Boneh and G. Durfee. Cryptanalysis of RSA with private key d less than N0.292. IEEE Transactions on Information Theory, IT-46, 2000.
5. D. Bernstein. Distinguishing prime numbers from composite numbers: The state of the art in 2004. Manuscript at http://cr.yp.to/primetests.html, 2004.