Paper 2015/1026 Original: eprint.iacr.org/2015/1026 ↗
Hardness Estimation of LWE via Band Pruning
Abstract
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.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2015-10-27: last updated
- 2015-10-26: published
- Short URL
- https://ia.cr/2015/1026
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2015/1026,
author = {Yoshinori Aono and Le Trieu Phong and Lihua Wang},
title = {Hardness Estimation of LWE via Band Pruning},
howpublished = {Cryptology {ePrint} Archive, Paper 2015/1026},
year = {2015},
url = {https://eprint.iacr.org/2015/1026}
}