Paper 2010/613 Original: eprint.iacr.org/2010/613 ↗
Better Key Sizes (and Attacks) for LWE-Based Encryption
Abstract
We analyze the concrete security and key sizes of theoretically sound lattice-based encryption schemes based on the ``learning with errors'' (LWE) problem. Our main contributions are: (1)~a new lattice attack on LWE that combines basis reduction with an enumeration algorithm admitting a time/success tradeoff, which performs better than the simple distinguishing attack considered in prior analyses; (2)~concrete parameters and security estimates for an LWE-based cryptosystem that is more compact and efficient than the well-known schemes from the literature. Our new key sizes are up to $10$ times smaller than prior examples, while providing even stronger concrete security levels.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2010-11-30: last updated
- 2010-11-30: published
- Short URL
- https://ia.cr/2010/613
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2010/613,
author = {Richard Lindner and Chris Peikert},
title = {Better Key Sizes (and Attacks) for LWE-Based Encryption},
howpublished = {Cryptology {ePrint} Archive, Paper 2010/613},
year = {2010},
url = {https://eprint.iacr.org/2010/613}
}