Cryptographic Applications of Capacity Theory - On the Optimality of Coppersmith's Method

Explore cryptographic applications of capacity theory in this 27-minute conference talk from Asiacrypt 2016. Delve into the optimality of Coppersmith's Method, starting with an introduction and examples before progressing through auxiliary polynomials, classical problems, and the main theorem. Examine the Minkowski theorem and Coppersmith's theorem, and investigate nonzero polynomials and the Cantor Bromley capacity theory. Learn about Coppersmith's method, auxiliary functions, and polynomial finding techniques. Discover other applications and questions related to the shape of n and compact sets. Conclude with a new result in this comprehensive exploration of advanced cryptographic concepts.

Introduction
Example
Auxilary polynomials
Proof that things dont exist
Classical problem
Main theorem
Minkowski theorem
Coppersmiths theorem
Nonzero polynomials
Cantor Bromley capacity theory
Coppersmiths method
More auxiliary functions
Finding a polynomial
Other applications
Other questions
Shape of n
Compact set
New result