Author:
Wang Mingqiang,Zhan Tao,Zhang Haibin
Publisher
Springer International Publishing
Reference23 articles.
1. Akavia, A., Goldwasser, S., Safra, S.: Proving hard-core predicates using list decoding. In: FOCS, pp. 146–157. IEEE Computer Society (2003)
2. Alexi, W., Chor, B., Goldreich, O., Schnorr, C.: RSA and Rabin functions: certain parts are as hard as the whole. SIAM J. Comput. 17(2), 194–209 (1988)
3. Ben-Or, M.: Probabilistic algorithms in finite fields. In: FOCS 1981, vol. 11, pp. 394–398 (1981)
4. Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudorandom bits. SIAM J. Comput. 13(4), 850–864 (1984)
5. Lecture Notes in Computer Science;D Boneh,2001
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献