Date/Time: Thursday, March 23, 2023. 10.30 am
Venue: Lecture Hall 6, CMI
Foundations of Lattice-based Cryptography
Weizmann Institute of Science, Israel.
Public key cryptography is essential for internet security, and RSA and Diffie-Hellman are the most widely used public-key cryptosystems for internet traffic. However, recent progress in building quantum computers threatens RSA and Diffie-Hellman's security, as they are vulnerable to quantum adversaries. To address this, organizations like the National Institute of Standards and Technology (NIST) and the European Telecommunications Standards Institute (ETSI) have started standardizing and deploying cryptosystems that are secure against quantum attacks. Recently, NIST has chosen Kyber and Dilithium, lattice-based candidates, as primary algorithms for security against quantum adversaries. The security of these cryptosystems crucially relies on the assumption that the best-known algorithms for the lattice problems cannot be significantly improved.
In this talk, I will discuss the connections between the security of lattice-based cryptosystems and the hardness of lattice problems. I will talk about classical and quantum algorithms for lattice problems. I will also discuss the works on the fine-grained security of lattice-based Crypto.
Rajendra Kumar is a Postdoctoral Fellow at the Weizmann Institute of Science, Israel. He completed his Ph.D. under the Joint degree program of the Indian Institute of Technology Kanpur, and the National University of Singapore. He is broadly interested in algorithms, quantum computing, and cryptography, with special interests in lattice algorithms and reductions. In particular, he gave the current fastest quantum algorithm for the Shortest Vector Problem in lattices.