The Concrete Complexity of LWE without Gaussian Sampling

Abstract

The LWE problem is a widely used tool in cryptography because of the well hardness and cryptographic versatility. In consideration of efficiency, a variant of LWE---LWE uniform errors, is proposed with some related work. However, no conclusion has been given to the complexity analysis for the LWE without Gaussian sampling of restricted samples. By combining the attack methods of standard LWE problem, we expand them to the discussion of the variant successfully. As a result, the complexity analysis results are given, and the estimations of runtime are also provided.