Author:
Bellare Mihir,Halevi Shai,Sahai Amit,Vadhan Salil
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. M. Ajtai and C. Dwork. A public-key cryptoSystem with worst-case/average-case equivalence. Proceedings of the 29th Annual Symposium on the Theory of Computing, ACM, 1997.
2. Adleman, Manders and Miller. On taking roots in finite fields. Proceedings of the 18th Symposium on Foundations of Computer Science, IEEE, 1977.
3. M. Bellare, S. Halevi, A. Sahai, and S. Vadhan. Many-to-one trapdoor functions and their relation to public-key cryptosystems. Pull version of this paper, available via http://www-cse.ucsd.edu/users/mihir.
4. M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. Proceedings of the First Annual Conference on Computer and Communications Security, ACM, 1993.
5. E. Berlekamp. Factoring polynomials over large finite fields. Mathematics of Computation, Vol. 24, 1970, pp. 713–735.
Cited by
40 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献