Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. G.B. Agnew, R.C. Mullin, I.M. Onyszchuk, and S.A. Vanstone. An implementation for a fast public-key cryptosystem. Journal of Cryptology, 3(2):63–79, 1991.
2. D.E. Knuth. The art of computer programming, vol. 3: sorting and searching. Addison-Wesley, Reading, Mass., 1973.
3. A.K. Lenstra and H.W. Lenstra. Algorithms in Number Theory, volume A, chapter 12, pages 673–716. MIT press, 1990.
4. A. Odlyzko. Private communication.
5. J.M. Pollard. Monte Carlo methods for index computation (mod p). Mathematics of computation, 32(143):918–924, July 1978.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献