Cryptography from Lattices
Georgia Institute of Technology
Monday, December 01, 2014|
4:00pm - 5:00pm
Add to Google Calendar
About the Event
Cryptography inherently relies on mathematical problems that are
conjectured to be infeasible, e.g., factoring large integers.
However, most of the commonly used problems result in cryptosystems
that are too inefficient or inflexible for use in many environments.
Moreover, all of the commonly used problems behind today's public-key
cryptography can in principle be broken by quantum computers.
Chris Peikert is an Associate Professor in the School of Computer Science at Georgia Tech. His research interests include cryptography, computational complexity, and algorithms, especially in relation to lattices, error-correcting codes, and number theory. He is the recipient of a Sloan Fellowship, an NSF CAREER Award, a Google Faculty Award, and multiple Best Paper and teaching awards.
Open to: Public