March 28
Upcoming Presentation
Date & Time: Thursday, March 31, 2011 4:30 - 5:30 p.m.
Location: ITB/101A
Speaker: Ariel Fernandez
Title: The Proof Complexity of Lattice-Based Cryptography
Abstract:
We take a proof-complexity approach to study the LLL algorithm for lattice-reductions. The LLL algorithm, while ubiquitous and very well known, is still not completely understood; for example, the relationship between the various constants and the running time.