Cryptology ePrint Archive: Report 2019/009

On the Asymptotics of Solving the LWE Problem Using Coded-BKW with Sieving

Qian Guo and Thomas Johansson and Erik Mårtensson and Paul Stankovski Wagner

Abstract: 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 Blum-Kalai-Wasserman (BKW) algorithm and ideas from sieving in lattices. The new algorithm is analyzed and demonstrates an improved asymptotic performance. For the 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.893n}$ in the standard setting, improving on the previously best known complexity of roughly $2^{0.930n}$. The newly proposed algorithm also provides asymptotic improvements when a quantum computer is assumed or when the number of samples is limited.

Category / Keywords: public-key cryptography /

Original Publication (with major differences): IACR-ASIACRYPT-2017

Date: received 4 Jan 2019

Contact author: erik martensson at eit lth se

Available format(s): PDF | BibTeX Citation

Version: 20190109:004327 (All versions of this report)

Short URL: ia.cr/2019/009


[ Cryptology ePrint archive ]