On the Efficacy of Solving LWE by Reduction to Unique-SVP

  title={On the Efficacy of Solving LWE by Reduction to Unique-SVP},
  author={Martin R. Albrecht and Robert Fitzpatrick and Florian G{\"o}pfert},
  journal={IACR Cryptology ePrint Archive},
We present a study of the concrete complexity of solving instances of the unique shortest vector problem (uSVP). In particular, we study the complexity of solving the Learning with Errors (LWE) problem by reducing the Bounded-Distance Decoding (BDD) problem to uSVP and attempting to solve such instances using the ‘embedding’ approach. We experimentally derive a model for the success of the approach, compare to alternative methods and demonstrate that for the LWE instances considered in this… CONTINUE READING
Highly Cited
This paper has 44 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 30 extracted citations


Publications referenced by this paper.
Showing 1-10 of 24 references

Solving BDD by Enumeration: An Update

View 6 Excerpts
Highly Influenced

Shortest Lattice Vectors in the Presence of Gaps

IACR Cryptology ePrint Archive • 2011
View 5 Excerpts
Highly Influenced

Better Key Sizes (and Attacks) for LWE-Based Encryption

IACR Cryptology ePrint Archive • 2010
View 8 Excerpts
Highly Influenced

Predicting Lattice Reduction

View 9 Excerpts
Highly Influenced

Albrecht , Pooya Farshim , Jean - Charles Faugère , and Ludovic Perret . Polly Cracker , revisited

R. Martin
On the complexity of the BKW algorithm on LWE . Designs , Codes and Cryptography • 2013

Nguyen . Solving BDD by enumeration : An update

Mingjie Liu, Xiaoyun Wang, Guangwu Xu, Xuexin Zheng
CT - RSA , volume 7779 of Lecture Notes in Computer Science • 2013

Similar Papers

Loading similar papers…