Integer lattices play a central role in mathematics and computer science, with applications ranging from number theory and coding theory to combinatorial optimization. Over the past three decades, they have also become a cornerstone of modern cryptography.In this talk, I will describe the evolution of lattices in cryptography: from H. Minkowski's work in the 1900; to A. Lenstra, H. Lenstra and L. Lovasz's algorithm in the 1980s whose early use resulted in the break of several classical cryptosystems; to their rebirth in the 1990s through the works of M. Ajtai and O. Regev as a way to design new encryption and digital signature schemes with (conjectured) post-quantum security; and to their role in the 2000s in achieving long-standing cryptographic goals such as fully homomorphic encryption that allow us to compute directly on encrypted data.The talk will not assume any prior background in cryptography.
Zoom Meeting: https://icts-res-in.zoom.us/j/99428416988?pwd=GeUkAxMpOQ1a0RK2T41ZcuRhnrPbDX.1
Meeting ID: 994 2841 6988
Passcode: 844489