International Association for Cryptologic Research

International Association
for Cryptologic Research

IACR News item: 26 October 2015

Yoshinori Aono, Le Trieu Phong, Lihua Wang
ePrint Report ePrint Report
This paper, examining the hardness of the search LWE problem, is a refined continuation of previous works including (Lindner-Peikert 2011, Liu-Nguyen 2013, Aono et al. 2013) using lattice reduction and lattice vector enumeration. We adopt the attack to the LWE using discrete Gaussian distribution, and propose a new bounding method named band pruning in lattice enumeration. We update the security estimations for several parameter sets proposed in the literature. Finally, using the data gained in our experiments, we derive an explicit formula linking the LWE\'s parameters with the bit security.

Expand

Additional news items may be found on the IACR news page.