Lattices in Quantum Cryptography: An Introduction 📚

Welcome to 'Quantum Algorithms & Cryptography' course !

This lecture introduces lattices as potential candidates for building post-quantum cryptography. It provides examples of lattices in nature, such as crystals, and defines lattices formally as periodic arrangements of points. The lecture introduces the shortest vector problem (SVP), a fundamental problem in lattice-based cryptography, and discusses the significance of approximation algorithms for solving SVP.
NPTEL Courses permit certifications that can be used for Course Credits in Indian Universities as per the UGC and AICTE notifications.

To understand various certification options for this course, please visit https://nptel.ac.in/courses/106106241

#Lattices #Postquantumcryptography #Crystals #SVP #Shortestvectorproblem #Approximationalgorithms