Hardness of SIS and LWE with Small Parameters.
ADVANCES IN CRYPTOLOGY - CRYPTO 2013, PT I(2013)
摘要
The Short Integer Solution (SIS) and Learning With Errors (LWE) problems are the foundations for countless applications in lattice-based cryptography, and are provably as hard as approximate lattice problems in the worst case. An important question from both a practical and theoretical perspective is how small their parameters can be made, while preserving their hardness. We prove two main results on SIS and LWE with small parameters. For SIS, we show that the problem retains its hardness for moduli q >= beta . n(delta) for any constant delta > 0, where beta is the bound on the Euclidean norm of the solution. This improves upon prior results which required q > beta . root n log n, and is close to optimal since the problem is trivially easy for q <= beta For LWE, we show that it remains hard even when the errors are small (e.g., uniformly random from {0, 1}), provided that the number of samples is small enough (e.g., linear in the dimension n of the LWE secret). Prior results required the errors to have magnitude at least root n and to come from a Gaussian-like distribution.
更多查看译文
关键词
Lattice cryptography,Computational hardness,SIS,LWE
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络