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 BKW algorithm and ideas from sieving in lattices. The new algorithm is analyzed and demonstrates an improved asymptotic performance. For Regev parameters q = n2 and noise level (Forumula presented), 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.
Author supplied keywords
Cite
CITATION STYLE
Guo, Q., Johansson, T., Mårtensson, E., & Stankovski, P. (2017). Coded-BKW with sieving. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10624 LNCS, pp. 323–346). Springer Verlag. https://doi.org/10.1007/978-3-319-70694-8_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
