Oded Regev (Hebrew: עודד רגב; born 1980 or 1979) is an Israeli-American theoretical computer scientist and mathematician.
He completed his Ph.D. at the age of 21, advised by Yossi Azar, with a thesis titled "Scheduling and Load Balancing.
"[4][5] He held faculty positions at Tel Aviv University and the École Normale Supérieure before joining the Courant institute.
He is best known for introducing the learning with errors problem (LWE), for which he won the 2018 Gödel Prize.
[7] As the citation reads: Regev’s work has ushered in a revolution in cryptography, in both theory and practice.
Toward the practical end, LWE and its direct descendants are at the heart of several efficient real-world cryptosystems.
These include quantum computing, communication complexity, hardness of approximation, online algorithms, combinatorics, probability, and dimension reduction.
[13][14] Regev is an associate editor in chief of the journal Theory of Computing,[15] and is a co-founder and organizer of the TCS+ online seminar series.
[16] In August 2023 Regev published a preprint[17][18][19] describing an algorithm to factor integers with