Author:
Vasco Maria Isabel González,Näslund Mats
Reference60 articles.
1. W. Alexi, B. Chor, O. Goldreich, and C. P Schnorr RSA and Rabin functions: certain parts are as hard as the whole, SIAM Journal on Computing 17 (1988), 194–209.
2. L. Babai, On Lovasz lattice reduction and the nearest lattice point problem, Combinatorica, 6 (1986), 11–13, 1986.
3. M. Bellare and P. Rogaway, Optimal asymmetric encryption, Proceedings of Eurocrypt ‘84, LNCS 950, pp. 92–111, Springer-Verlag.
4. M. Ben-Or, B. Chor, and A Shamir, On the cryptographic security of single RSA bits, Proceedings of the 15th ACM STOC, 1983, pp. 421–430.
5. M. Blum and S. MicaliHow to generate cryptographically strong sequences of pseudorandom bits, SIAM Journal on Computing, 13 (1986), 850–864.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献