Kumar, R. and Sivakumar, D. (2001) On Polynomial Approximation to the Shortest Lattice Vector Length. Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, Washington DC, 7-9 January 2001, 126-127.

has been cited by the following article:

• TITLE: Learning with Errors Public Key Cryptosystem with Its Security

  AUTHORS: Zhiyong Zheng, Kun Tian, Yi Zhang, Yunfan Lu

  KEYWORDS: Learning With Errors Problem, Cryptosystem, Decryption Error, Probability, Security

  JOURNAL NAME: Journal of Information Security, Vol.14 No.1, January 18, 2023

  ABSTRACT: The main purpose of this paper is to introduce the LWE public key cryptosystem with its security. In the first section, we introduce the LWE public key cryptosystem by Regev with its applications and some previous research results. Then we prove the security of LWE public key cryptosystem by Regev in detail. For not only independent identical Gaussian disturbances but also any general independent identical disturbances, we give a more accurate estimation probability of decryption error of general LWE cryptosystem. This guarantees high security and widespread applications of the LWE public key cryptosystem.