Welcome to the resource topic for 2013/602
Title:
On the Efficacy of Solving LWE by Reduction to Unique-SVP
Authors: Martin R. Albrecht, Robert Fitzpatrick, Florian G ̈opfert
Abstract: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 work, reducing to uSVP and solving via embedding compares favorably to other approaches.
ePrint: https://eprint.iacr.org/2013/602
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .