CS SEMINAR
Dimension preserving reductions between SVP and CVP in Different p-Norms
Speaker
Mr Li Zeyong, National University of Singapore, email: cqtlz@nus.edu.sgChaired by
Dr Arnab BHATTACHARYYA, Associate Professor, School of Computing arnab@comp.nus.edu.sg
24 May 2021 Monday, 02:00 PM to 03:00 PM
via Zoom
Abstract:
Quantum resistance and lattices' many other unique properties make lattice-based cryptosystems the most popular candidate for post-quantum cryptography. In this talk, we will focus on the Shortest Vector Problem and the Closest Vector Problem over lattices in different Lp norms. We will discuss several exponential time reductions between these lattice problems. This is joint work with Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, and Noah Stephens-Davidowitz.
More detailed abstract available here: https://arxiv.org/abs/2104.06576.
Biodata:
Li Zeyong is a Ph.D. student at the Centre for Quantum Technologies, working on problems in complexity theory and lattice-based cryptosystems.