Future students

Tuesday, April 17, 2012 12:00 am - 1:00 pm EDT (GMT -04:00)

Leonard Schulman: Cryptography from tensor problems

Leonard Schulman, California Institute of Technology

Abstract

We describe a new cryptosystem which (conjecturally) provides both a
trap-door one-way function and a signature scheme. The new system is a
type of "multivariate quadratic" cryptosystem, but is based on a
different trap-door from existing methods, and is simpler.

Aram Harrow, University of Washington

Abstract

This talk will begin by justifying the first part of the title, by explaining a method to test whether a given multipartite pure state is product or far from product, given only two copies of the state. Next, I'll explain how this test has implications for the computational hardness of a large number of optimization problems.