Lattice based cryptography - A new approach towards post-quantum cryptography
Il 17 gennaio 2020 alle 11.00
Sala Riunioni al 5° piano del Dipartimento di informatica in Via Celoria 18
Speaker: dott. Rohon Kundu del Dipertimento di Matematica di Milano
Referente: Andrea Visconti
In this talk I will at first introduce the fundamental structure of Lattice-Based Cryptography. The mathematical foundation underlying the lattices are important in order to understand the computational hard problem. Lattices in higher dimensions are difficult to visualize and hence it become more challenging to solve the Shortest Vector Problem(SVP) and the Closest Vector Problem(CVP), which plays an integral role in making lattice-based cryptographic schemes quantum proof. Learning With Error Problem over rings (R-LWE) will be introduced in order to discuss the classical hardness of R-LWE. In the second part, I will discuss the algorithms based on lattice-based submitted in NIST Round II like NTRU. The early work done by Ajtai and D-work plays an integral role in the development of the NTRU scheme. Finally I talk about hardness of NTRU, which is considered to be an open problem.
Rohon Kundu is a second year ALGANT Double Master Degree student at the Department of Mathematics, University of Milan. Previous to that he completed his first Master Degree from University of Regensburg, Germany. His main research interest lies in the field of Post-Quantum Cryptography(PQC) and the relevance of
Applied Algebra in PQC. Specifically he is interested in Lattice-Based and Supersingular Isogeny Based Cryptosystems. He is currently working on his Master Thesis under the supervision of Prof. Dr. Andrea Visconti based on "Algebraic Attack on Lattice Based Cryptosystems". After completing his Bachelor, Rohon received the Erasmus Mundus Fellowship by the ALGANT Consortium to study in Germany and Italy. He is also an Associate Member of the London Mathematical Society and the European Mathematical Society.