Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Using Lattices for Cryptanalysis

Simons Institute via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the application of lattice-based techniques in cryptanalysis through this comprehensive lecture. Delve into breaking classical cryptography using lattices, solving knapsack problems, and understanding practical lattice reduction methods. Examine lattice attacks on NTRU and gain insights into Coppersmith's method for univariate polynomials. Learn about Coppersmith's Algorithm, including finding solutions modulo divisors and multivariate applications. Discover the concept of approximate common divisors and its relevance in cryptography. This talk, presented by Nadia Heninger from UC San Diego, is part of the Lattices: Algorithms, Complexity, and Cryptography Boot Camp at the Simons Institute.

Syllabus

Intro
Talk outline: Breaking classical crypto with lattices
Warm-up 1: Solving knapsack problems with lattices
Practical note: Current feasible lattice reduction
Warm-up 2: Lattice attacks on NTRU
Coppersmith's method for univariate polynomials
Coppersmith's Algorithm Outline
Coppersmith's method outline
Finding solutions modulo divisors
Multivariate Coppersmith
Application: Approximate common divisors

Taught by

Simons Institute

Reviews

Start your review of Using Lattices for Cryptanalysis

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.