Sammanfattning
The Learning with Errors problem (LWE) has become a central topic in recent cryptographic research. In this paper, we present a new solving algorithm combining important ideas from previous work on improving the BKW algorithm and ideas from sieving in lattices. The new algorithm is analyzed and demonstrates an improved asymptotic performance. For Regev parameters q = n^2 and noise level \sigma = n^1.5/(\sqrt{2\pi} \log_2^2 n), the asymptotic complexity is 2^{0.895n} in the standard setting, improving on the previously best known complexity of roughly 2^{0.930n}. Also for concrete parameter instances, improved performance is indicated.
Originalspråk | engelska |
---|---|
Titel på värdpublikation | Advances in Cryptology - ASIACRYPT 2017 - 23rd International Conference on the Theory and Application of Cryptology and Information Security, Proceedings |
Förlag | Springer |
Sidor | 323-346 |
ISBN (elektroniskt) | 978-3-319-70694-8 |
ISBN (tryckt) | 978-3-319-70693-1 |
DOI | |
Status | Published - 2017 |
Evenemang | 23rd Annual International Conference on the Theory and Applications of Cryptology and Information Security (ASIACRYPT), 2017 - Hong Kong, Kina Varaktighet: 2017 dec. 3 → 2017 dec. 7 Konferensnummer: 23 https://asiacrypt.iacr.org/2017/index.html |
Publikationsserier
Namn | Lecture Notes in Computer Science |
---|---|
Förlag | Springer |
Volym | 10624 |
ISSN (tryckt) | 0302-9743 |
Konferens
Konferens | 23rd Annual International Conference on the Theory and Applications of Cryptology and Information Security (ASIACRYPT), 2017 |
---|---|
Förkortad titel | ASIACRYPT |
Land/Territorium | Kina |
Ort | Hong Kong |
Period | 2017/12/03 → 2017/12/07 |
Internetadress |
Ämnesklassifikation (UKÄ)
- Annan elektroteknik och elektronik