Author:
Boyko Victor,Peinado Marcus,Venkatesan Ramarathnam
Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. W. Aiello, S. Rajagopalan, and R. Venkatesan. Design of practical and provably good random number generators. In Proceedings of the 6th Annual Symposium on Discrete Algorithms, pages 1–9, San Francisco, January 1995. ACM Press. (also to appear in Journal of Algorithms).
2. N. Alon and Y. Roichman. Random Cayley graphs and expanders. Random Structures and Algorithms, 5, 1994.
3. D. Boneh and R. Venkatesan. Breaking RSA may not be equivalent to factoring. Eurocrypt '98, this proceedings.
4. E. Brickell. Solving low density knapsacks. In Proceedings of Crypto'83, pages 25–37, New York, 1984. Plenum Press.
5. E. F. Brickell, D. M. Gordon, K. S. McCurley, and D. B. Wilson. Fast exponentiation with precomputation. In R. A. Rueppel, editor, Advances in Cryptology: EUROCRYPT '92, volume 658 of Lecture Notes in Computer Science, pages 200–207, Berlin, 1993. Springer-Verlag.
Cited by
72 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献