CRYPTO NEWS

Why does Learning With Errors require a bunch of samples?

Solving Learning with Errors(LWE) with average case complexity is as hard as solving the SVP with worst case complexity.

LWE requires $n$ dimensional lattice and $m$ samples of it, and Decisional-LWE is form of

$(mathbf{A},mathbf{sA+e}) approx (mathbf{A},mathbf{r}) $

My question is why the random matrix is the form $mathbf{A} in mathbb{Z}_q^{mtimes n}$ ($m >> n$)?

Is $m=1$ easily solved?

I think in the case of Ring LWE, $m=1$ can work.

Why does Learning With Errors require a bunch of samples?

Shopping cart
There are no products in the cart!
Continue shopping
0