LWE Without Modular Reduction and Improved Side-Channel Attacks Against BLISS

The variant of Regev’s learning with errors (LWE) problem in which modular reduction is omitted is analyzed, and it is shown that the problem can be solved efficiently as long as the variance of e is not superpolynomially larger than that of $\mathbf { a}$.