Author:
LENSTRA A.K.,LENSTRA H.W.
Reference86 articles.
1. ADLEMAN, L. M., A subexponential algorithm for the discrete logarithm problem with applications, in: Proc. 20th Ann. IEEE Symp. on Foundations of Computer Science (1979) 55–60.
2. ADLEMAN, L. M. and M. A. HUANG, Recognizing primes in random polynomial time, Research report, Dept. of Computer Science, Univ. of Southern California, 1988; extended abstract in: Proc. 19th Ann. ACM Symp. on Theory of Computing (1987) 462–469.
3. On distinguishing prime numbers from composite numbers;ADLEMAN;Ann. of Math.,1983
4. ATKIN, A. O. L. Personal communication, 1985.
5. Analytic Methods in the Analysis and Design of Number-theoretic Algorithms;BACH,1985
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献