1. ADLEMAN, L. M., A subexponential algorithm for the discrete logarithm problem with applications to cryptography, in: Proc. 18th IEEE Symp. on Foundations of Computer Science (1977) 55–60.
2. ADLEMAN, L. M., On breaking generalized knapsack public key cryptosystems, in: Proc. 15th ACM Symp. on Theory of Computing (1983) 402–412.
3. ADLEMAN, L. M. and M. A. HUANG, Recognizing primes in random polynomial time, in: Proc. 19th ACM Symp. on Theory of Computing (1987) 462–469.
4. ADLEMAN, L. M., K. MANDERS and G. MILLER, On taking roots in finite fields, in: Proc. 18th IEEE Symp. on Foundations of Computer Science (1977) 175–177.
5. On distinguishing prime numbers from composite numbers;ADLEMAN;Ann. Math.,1983