Lattice Attacks for Variants of LWE

Subscribers:
344,000
Published on ● Video Link: https://www.youtube.com/watch?v=gPUgjzVHb9k



Duration: 56:49
1,495 views
19


The learning with errors (LWE) problem introduced by Regev (STOC'05) is one of the fundamental problems in lattice-based cryptography. It has been used extensively as a security foundation, for public-key encryption, signatures, fully homomorphic encryption (FHE), pseudo-random functions (PRF) and many others. One standard strategy to solve the LWE problem is to reduce it to a unique SVP (uSVP) problem via Kannan's embedding and then apply a lattice reduction to solve the uSVP problem. In this talk, we will discuss and compare various lattice algorithms for solving LWE, and then give some concrete estimates for breaking various variants of LWE (e.g. generic, small secrets, restricted samples). In the end, we will discuss some recent developments on algorithms for solving LWE.

See more at https://www.microsoft.com/en-us/research/video/lattice-attacks-for-variants-of-lwe/







Tags:
microsoft research