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

  • Martin R. Albrecht
  • Robert Fitzpatrick
  • Florian Göpfert
Conference paper

DOI: 10.1007/978-3-319-12160-4_18

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8565)
Cite this paper as:
Albrecht M.R., Fitzpatrick R., Göpfert F. (2014) On the Efficacy of Solving LWE by Reduction to Unique-SVP. In: Lee HS., Han DG. (eds) Information Security and Cryptology -- ICISC 2013. ICISC 2013. Lecture Notes in Computer Science, vol 8565. Springer, Cham

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.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Martin R. Albrecht
    • 1
  • Robert Fitzpatrick
    • 2
  • Florian Göpfert
    • 3
  1. 1.Technical University of DenmarkKongens LyngbyDenmark
  2. 2.ISG, Royal HollowayUniversity of LondonEghamUK
  3. 3.CASEDTU DarmstadtDarmstadtGermany

Personalised recommendations