Upcoming Talk

Title

Speaker

Date

Time

Venue

Abstract

Efficient reductions among lattice problems

Rajendra Kumar

17th April 2019

10:00AM - 11:00AM

KD102

Lattice-based cryptosystems are the main candidate of Post-quantum cryptography. In this talk, we will cover the reductions between the lattice problem and how there hardness factor is related.

Who are we???

SIGTACS - Special Interest Group on Theoretical Aspects of Computer Science, was born out of an effort to bring together people interested in areas of Theoretical Computer Science.


What we do???

It is a platform for students and faculty members to come together and share their excitement in the area. The group aims at organizing problem solving sessions, seminars and guest lectures.

What we like???

Algorithms, Combinatorics, Cryptology, Quantum Computing, Graph-Theory, Information Theory, Game-Theory, Computational Complexity.


Contact

Image

Sumanta Ghosh

Head Co-ordinator

Image

Rajendra Kumar

Co-ordinator

Image

Mahesh S R

Co-ordinator