Research Statement: The security of current Public Key Cryptosystems relies on the hardness of their underlying problems. For example, the RSA Cryptosystem relies on the hardness of integer factorization. There is currently not a way for a classical computer to find the prime factors in less than exponential time. However, Shor's algorithm factors integers on a quantum computer in polynomial time. Companies like IBM, Google, and Microsoft have invested billions into the research and development of quantum computers, racing to achieve quantum supremacy. This gives rise to a need for quantum-safe cryptosystems, and constructions based on integer lattices are proving promising.
The vast majority of university Cryptography courses are housed in graduate programs and assume prior computer programming knowledge. I assert that this content is accessible to undergraduate students who have taken a course in Linear Algebra. The goal of this course is to make introductory lattice-based cryptography accessible to undergraduate students in mathematics, computer science, engineering, and other related fields. By engaging students with the theoretical and practical applications of modern cryptographic algorithms, students will be prepared to enter careers in related fields upon graduation.
Research Projects: I hope to facilitate undergraduate and graduate research in the area of post-quantum Mathematical Cryptography. In this document, please find potential student research projects.