I am a third-year PhD student at MIT, where I am advised by Vinod Vaikuntanathan. I’m interested in theoretical computer science, particularly cryptography and complexity theory. I am supported by an NSF Graduate Research Fellowship.

Before MIT, I was a software engineer at Google (YouTube). Prior to that, I received a BA in mathematics from Harvard University. As an undergraduate, I attended the DIMACS REU (under Eric Allender’s mentorship) and Ken Ono’s number theory REU (under his and John Duncan’s mentorship). I also interned in industry at Facebook and Jane Street.

Here is my CV.

Recent News


MacORAMa: Optimal Oblivious RAM with Integrity
Surya Mathialagan, NV

Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures
Aparna Gupte, NV, Vinod Vaikuntanathan
FOCS 2022
[arXiv] [ePrint] [Video at CMU] [Video at FOCS] [Video at Simons]

Average-case Hardness of NP and PH from Worst-case Fine-grained Assumptions
Lijie Chen, Shuichi Hirahara, NV
ITCS 2022
[Paper] [Video]

The Non-hardness of Approximating Circuit Size
Eric Allender, Rahul Ilango, NV
CSR 2019
Invited to Special Issue of Theory of Computing Systems

Moonshine for All Finite Groups
Samuel DeHority, Xavier Gonzalez, NV, Roger Van Peski
Research in the Mathematical Sciences

Authors are listed in alphabetical order of last name, as is the convention in theoretical computer science and mathematics.