Author:
Mihailescu Marius Iulian,Nita Stefania Loredana
Reference14 articles.
1. O. Regev, The Learning with Errors Problem, Available online: https://cims.nyu.edu/~regev/papers/lwesurvey.pdf. Last accessed: 11.3.2023
2. O. Regev, “On lattices, learning with errors, random linear codes, and cryptography”, Journal of the ACM (JACM), vol. 56, no. 6, pp. 1–40, 2009.
3. R. Lindner and C. Peikert, “Better key sizes (and attacks) for LWE-based encryption”, in Topics in Cryptology–CT-RSA 2011: The Cryptographers’ Track at the RSA Conference 2011, San Francisco, CA, USA, February 14-18, 2011. Proceedings, Springer, 2011, pp. 319–339.
4. O. Regev, “The Learning with Errors Problem (Invited Survey),” 2010 IEEE 25th Annual Conference on Computational Complexity, Cambridge, MA, 2010, pp. 191–204, doi: 10.1109/CCC.2010.26.
5. O. Regev, “Lattice-based cryptography”, in Advances in Cryptology-CRYPTO 2006: 26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2006. Proceedings 26, Springer, 2006, pp. 131–141.