Overview
Explore the Short Integer Solutions (SIS) problem and its cryptographic applications in this comprehensive lecture by Daniele Micciancio from UC San Diego. Delve into the intricacies of lattice-based cryptography, examining worst-case to average-case reductions and their implications for Minicrypt. Gain insights into the fundamental concepts and algorithms underlying lattice-based cryptosystems, and understand how the SIS problem serves as a foundation for various cryptographic constructions. Discover the connections between lattice theory, complexity theory, and modern cryptography in this in-depth presentation from the Lattices: Algorithms, Complexity, and Cryptography Boot Camp at the Simons Institute.
Syllabus
The Short Integer Solutions Problem and Cryptographic Applications
Taught by
Simons Institute