A reduction from LWE problem to dihedral coset problem

Abstract

Learning with Errors (LWE) problems are the foundations for numerous applications in lattice-based cryptography and are provably as hard as approximate lattice problems in the worst case. Here we present a reduction from LWE problem to dihedral coset problem(DCP). We present a quantum algorithm to generate the input of the two point problem which hides the… (More)

3 Figures and Tables

Topics

  • Presentations referencing similar topics