Sze Ling Yeo

On the Closest Vector Problem for Lattices Constructed from Polynomials and Their Cryptographic Applications

2017 · arXiv (Cornell University)

In this paper, we propose new classes of trapdoor functions to solve the closest vector problem in lattices. Specifically, we construct lattices based on properties of polynomials for which the closest vector problem is hard …