2020
DOI: 10.1007/978-3-030-65277-7_19
|View full text |Cite
|
Sign up to set email alerts
|

Making the BKW Algorithm Practical for LWE

Abstract: The Learning with Errors (LWE) problem is one of the main mathematical foundations of post-quantum cryptography. One of the main groups of algorithms for solving LWE is the Blum-Kalai-Wasserman (BKW) algorithm. This paper presents new improvements for BKW-style algorithms for solving LWE instances. We target minimum concrete complexity and we introduce a new reduction step where we partially reduce the last position in an iteration and finish the reduction in the next iteration, allowing non-integer step sizes… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
4
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3
3
1

Relationship

3
4

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 30 publications
0
4
0
Order By: Relevance
“…This section covers the simulations we ran, using the FBBL library [32] from [33], and the results they yielded. For all figures, each point corresponds to running plain BKW plus distinguishing at least 30 times.…”
Section: Simulations and Resultsmentioning
confidence: 99%
“…This section covers the simulations we ran, using the FBBL library [32] from [33], and the results they yielded. For all figures, each point corresponds to running plain BKW plus distinguishing at least 30 times.…”
Section: Simulations and Resultsmentioning
confidence: 99%
“…This section covers the simulations we ran, using the FBBL library [31] from [32], and the results they yielded. For all figures, each point corresponds to running plain BKW plus distinguishing at least 30 times.…”
Section: Simulations and Resultsmentioning
confidence: 99%
“…With an implementation of the file-based algorithm, we managed to solve 6 challenges with Darmstadt challenge-type parameters, but with an unlimited number of samples, 3 more challenges than in the conference version of the paper [38]. For the 3 previously solved challenges, we made substantial improvements in runtime.…”
Section: Discussionmentioning
confidence: 99%
“…While we managed to substantially improve the implementation results of the conference version of the paper [38], we believe that significant improvements to the algorithm can still be made to reduce the gap compared to lattice-based techniques for solving LWE. For example, it remains to investigate the concrete improvement of employing the sieving aspect of coded-BKW with sieving [20].…”
Section: Discussionmentioning
confidence: 99%