The Learning with Rounding Problem: Reductions and Applications

  • Alon Rosen | The Interdisciplinary Center

In this talk I will survey a recently introduced cryptographic problem called Learning with Rounding (LWR). I will show reductions from and to the more well-established Learning with Errors (LWE) problem, and demonstrate the applicability of LWR to the construction of efficient Pseudorandom Functions and other cryptographic primitives.

Watch Next