1. L. Adleman, A subexponential algorithm for the discrete logarithm problem with applications to cryptography, Proceedings of the 20th Annual Symposium on Foundations of Computer Science, IEEE, New York, 1979, pp. 55–60.
2. L. Adleman and M. Huang, Recognizing primes in random polynomial time, Proceedings of the 19th Annual ACM Symposium on Theory of Computing, ACM, New York, 1987, pp. 462–470.
3. E. Bach, How to generate factored random numbers, SIAM Journal on Computing, vol. 17 (1988), pp. 179–193. Previously appeared in Proceedings of the 15th Annual ACM Symposium on Theory of Computing, ACM, New York, 1983, pp. 184–188.
4. M. Blum, Coin flipping by telephone, Proceedings of IEEE Spring COMPCON, 1982, pp. 133–137.
5. M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudo-random bits, SIAM Journal on Computing, vol. 13 (1984), pp. 850–864. Previously appeared in Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, IEEE, New York, 1982, pp. 112–117.