1. Akavia, A.: Learning Noisy Characters, Multiplication Codes and Hardcore Predicates. Ph.D. Thesis, Massachusetts Institute of Technology (2008)
2. Lecture Notes in Computer Science;A. Akavia,2009
3. Akavia, A., Goldwasser, S., Safra, S.: Proving Hard-Core Predicates Using List Decoding. In: FOCS 2003, pp. 146–157. IEEE Computer Society, Washington (2003)
4. Alexi, W., Chor, B., Goldreich, O., Schnorr, C.P.: RSA and Rabin Functions: Certain Parts are as Hard as the Whole. SIAM Journal on Computing 17(2), 194–209 (1988)
5. Ben-Or, M., Chor, B., Shamir, A.: On the Cryptographic Security of Single RSA Bits. In: Johnson, D.S., Fagin, R., Fredman, M.L., Harel, D., Karp, R.M., Lynch, N.A., Papadimitriou, C.H., Rivest, R.L., Ruzzo, W.L., Seiferas, J.I. (eds.) STOC 1983, pp. 421–430. ACM, New York (1983)