|Date: Friday, October 23, 2015
Location: 1084 East Hall (4:10 PM to 5:00 PM)
Title: How to (not) use lattices for fun and profit
Abstract: With the introduction of quantum computing, many classical problems in computer science become much easier to solve. In particular, common asymmetric cryptographic protocols like RSA--and its elliptic curve counterpart--become easily broken, so new protocols are required. One class of candidates is constructed from (conjecturally) hard lattice problems.
We will give an overview of common lattice problems, and describe how these can be used for cryptographic constructions. Time permitting, we will focus on the weakness of one particular cryptographic primitive, SOLILOQUY, that has recently been found to be susceptible to quantum attack, and describe a potential direction that may avoid such weaknesses.
Speaker: Brandon Carter
Institution: University of Michigan
Event Organizer: Jeremy Hoskins and Derek Wood