I am a postdoctoral researcher in the Department of Computer Science at Purdue University, hosted by Prof. Jeremiah Blocki. My past and ongoing work has involved the application of combinatorial graph theory to analyze the (post-quantum) security of Memory-Hard Functions and Proofs of Sequential Work. I have also worked on analyzing the preprocessing security of cryptographic primitives in multiple idealized models, including short Schnorr signatures. Recently, I have developed a deep interest in the mathematical foundations of isogeny-based cryptography, which leverages number theory and algebraic/arithmetic geometry to address key post-quantum security challenges.

I recently received my Ph.D. in the Department of Computer Science at Purdue University, and was honored to be advised by Prof. Jeremiah Blocki. Prior to joining Purdue, I completed my M.Sc in the Department of Mathematical Sciences at Seoul National University and B.Sc at POSTECH.

Contact. You may reach me at: lee2856@purdue.edu