Abstract: Quantum computers will have far-reaching impacts on cryptography. Shor showed that many of the cryptosystems used today can be broken using a quantum computer, and I will begin my talk by describing Shor’s algorithm for factoring integers. Next, I will give an overview of my research on attacking classical cryptosystems over a quantum channel, showing that even schemes resistant to Shor’s algorithm may be vulnerable to other forms of quantum attack. On the positive side, quantum computing gives rise to the possibility of quantum key distribution with unparalleled security guarantees, which I will cover at the end of the talk.
Bio: Mark Zhandry is a fourth-year Ph.D. student at Stanford University in the Department of Computer Science, studying cryptography and computer science theory under professor Dan Boneh. His research projects include investigating the many uses of program obfuscation and exploring the new security models associated with implementing classical cryptosystems on a quantum computer.