Abstract
AbstractThe main purpose of this chapter is to give an extension on learning with errors problem (LWE)-based cryptosystem about the probability of decryption error with more general disturbance. In the first section, we introduce the LWE cryptosystem with its application and some previous research results. Then we give a more precise estimation probability of decryption error based on independent identical Gaussian disturbances and any general independent identical disturbances. This upper bound probability could be closed to 0 if we choose applicable parameters. It means that the probability of decryption error for the cryptosystem could be sufficiently small. So we verify our core result that the LWE-based cryptosystem could have high security.
Publisher
Springer Nature Singapore
Reference25 articles.
1. Ajtai, M. (1996). Generating hard instances of lattice problems. Quaderni di Matematica, 1–32.
2. Ajtai, M. (2005). Representing hard lattices with O(NLOGN) bits. In Proceedings of the 37th ACM Symposium (pp. 94–103).
3. Ajtai, M., & Dwork, C. (1997). A public-key cryptosystem with worst-case/average-case equivalence. In Proceedings of the 29th ACM Symposium (pp. 284–293).
4. Ajtai, M., Kumar, R., & Sivakumar, D. (2001). A sieve algorithm for the shortest lattice vector problem. In Proceedings of the 33rd ACM Symposium (pp. 601–610).
5. Alekhnovich, M. (2003). More on average case versus approximation complexity. In Proceedings of the 44th Annual IEEE Symposium (pp. 298–307).