Oded Regev

Theoretical computer scientist whose Learning With Errors problem became the foundation of standardized post-quantum cryptography.

Core Principles & Analysis

• His worst-case to average-case reduction gave lattice cryptography a security argument no other family matches.
• Received the 2018 Gödel Prize for the LWE paper.
• In 2023 he also found an asymptotically faster variant of Shor's algorithm — contributing to both sides of the arms race.

Specifications & Metrics

• AFFILIATION: NYU Courant Institute
• KNOWN FOR: Learning With Errors (2005)