1. Akavia, A.: Learning Noisy Characters, Multiplication Codes and Cryptographic Hardcore Predicates. Ph.D dissertation, defended August 2007, MIT, EECS (February 2008)
2. Akavia, A., Goldwasser, S., Safra, S.: Proving Hard-Core Predicates using List Decoding. In: Proc. of 44th IEEE Annual Symposium on Foundations of Computer Science (FOCS 2003), pp. 146–157. IEEE Computer Society, Los Alamitos (2003)
3. Akavia, A.: Finding significant fourier coefficients deterministically and locally. ECCC Report TR08-102 (2008)
4. Lecture Notes in Computer Science;D. Boneh,1996
5. Boneh, D., Venkatesan, R.: Rounding in lattices and its cryptographic applications. In: SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms) (1997)