Title:  Crypto Capacity Theory 

Speaker: Ted Chinburg, University of Pennsylvania 

Abstract:  Suppose f(x) is a monic integral polynomial 
of degree d and that N is a positive integer.  With cryptographic 
applications in mind, Coppersmith showed in the 1990's  that there 
is a polynomial time algorithm for finding all integers r such that 
f(r) is congruent to 0 mod N and |r| < N^{1/d}.   In this talk I will 
discuss how Coppersmith's method is in fact a baby case of adelic 
capacity theory but with the additional input of the LLL theorem. This 
leads to a new approach to many results of this kind as well 
as to new variants of capacity theory. This is joint work 
with N. Heninger and Z. Scherr.