Research Project Title:
Shortest Vector Problem
abstract:The Shortest Vector Problem on integer lattices has been widely studied over the last few decades. There are many cryptographic constructions whose security assumes the worst-case hardness of the approximation version of this and related problems. This project focuses on improving the known results on this problem: our goal will be to either discover a new algorithm that improves the best known space and/or time complexity, or demonstrate an improved hardness result.
In this project, I would like to learn more about the problem itself and gain research experience. I am double major in mathematics and computer science, so I think this project allows me to apply knowledge from both disciplines. I believe that the material covered by Cryptography & Cryptanalysis (6.875/18.425) will be relevant to this project as well.