CS SEMINAR

Algorithms for Shortest Vector Problem via Bounded Distance Decoding

Speaker
Rajendra Kumar, Postdoctoral Researcher, CQT, NUS
Chaired by
Dr Arnab BHATTACHARYYA, Associate Professor, School of Computing
arnab@comp.nus.edu.sg

22 Nov 2021 Monday, 04:00 PM to 05:00 PM

via Zoom

(Meet-&-greet from 3:30 pm to 4 pm)

Abstract:
The quantum resistance and many other lattices' unique properties make lattice-based cryptosystems the most popular candidate for post-quantum cryptography. This talk will focus on Shortest Vector Problem(SVP) on lattices. Solvers of SVP have also found many applications in algorithmic number theory, convex optimization, and cryptanalysis. In this talk, we will discuss the algorithm for SVP, which provides a time-space tradeoff. We will also talk about the faster Classical and Quantum algorithms for SVP. This is joint work with Divesh Aggarwal, Yanlin Chen, and Yixin Shen.


Biodata:
Rajendra Kumar is a Postdoctoral Researcher at the Center for Quantum Technologies, working with Prof. Divesh Aggarwal. His general research interests lie in the theoretical foundations of Cryptography. He completed his Ph.D. in the Joint degree program of the Indian Institute of Technology Kanpur and NUS, under the guidance of Professors Manindra Agrawal and Divesh Aggarwal. His thesis was on the "Exponential Time/space algorithm for Lattice problems." During his Ph.D., he also worked on Cryptanalysis of Hash functions and Hardness of Approximation. Recently, he is also focusing on the construction of efficient lattice-based crypto primitives.