About Contribute GitHub
Menu

Oded Regev

Regev's lattice work connects hard computational problems with public-key cryptography. The Learning With Errors formulation became a major reference point for constructions designed to remain secure against known quantum attacks.

Oded Regev is a computer scientist at New York University's Courant Institute whose research includes lattice-based cryptography, quantum computation, and theoretical computer science.

Learning With Errors

His work introduced the Learning With Errors (LWE) problem in cryptography. LWE has become a widely used hardness assumption for lattice-based constructions and is important to the study of post-quantum cryptography.

Research record

Regev's academic work also addresses lattice problems and quantum computation. His NYU research page describes lattice cryptography as a main focus and records the 2018 Gödel Prize among his honors.

Security significance

His work is relevant to the security community because modern encryption designs need assumptions that can be evaluated against changing computational capabilities, including quantum computation.

Timeline

  • 2001Receives a Ph.D. in computer science from Tel Aviv University.
  • 2005Publishes work introducing the Learning With Errors problem in lattice-based cryptography.
  • 2018Receives the Gödel Prize, as recorded by NYU.
Oded Regev
Type
Person
Era
2000s-Present
Known for
Learning With Errors; Lattice-based cryptography; Post-quantum foundations
Tags
cryptography, lattices, post-quantum-cryptography, learning-with-errors, research
Created by Joas A Santos · Something wrong or want it removed? Open an issue.