- This event has passed.
Gengran Hu – Hangzhou Dianzi University
September 24, 2018 @ 4:30 pm - 6:30 pm EDT
On reductions from subset sum problem to shortest vector problem.
The shortest vector problem (SVP) is a fundamental problem in lattice theory and its applications in cryptography. The hardness of SVP is established by constructing reductions from the subset sum problem to SVP. In this talk, we shall show how to use -norm SVP Oracle to solve the subset sum problem with various densities.