1. Avanzi, R.M.: Fast evaluation of polynomials with small coefficients modulo an integer. Web document (2005),
http://caccioppoli.mac.rub.de/website/papers/trick.pdf
2. Lecture Notes in Computer Science;N. Gama,2008
3. Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st ACM Symposium on Theory of Computing – STOC 2009, pp. 169–178. ACM, New York (2009)
4. Lecture Notes in Computer Science;C. Gentry,2010
5. Gentry, C., Halevi, S.: Implementing gentry’s fully-homomorphic encryption scheme. Cryptology ePrint Archive, Report 2010/520 (2010),
http://eprint.iacr.org/