Cryptography has come a long way since invisible ink and decoder rings. Today we rely on the magic of prime numbers to keep our online transactions and records secure. I'll describe how cryptosystems work, from Caesar to the Kama Sutra to modern e-commerce, and how a future quantum computer would break them. I'll then describe what kinds of cryptography might remain secure even after quantum computers are built.
This talk is part of the John von Neumann Public Lectures in Complexity & Computation presented by C4.
Speaker bio: Cristopher Moore is a Professor at the Santa Fe Institute. He received his B.A. in Physics, Mathematics, and Integrated Science from Northwestern University, and his Ph.D. in Physics from Cornell. In 2000, he joined the University of New Mexico faculty, with joint appointments in Computer Science, and Physics and Astronomy. In 2012, Moore became full-time resident faculty at the Santa Fe Institute. He has published over 120 papers at the boundary between physics and computer science, ranging from quantum computing, to phase transitions in NP-complete problems, to the theory of social networks and efficient algorithms for analyzing their structure. He is a Fellow of the American Physical Society. With Stephan Mertens, he is the author of The Nature of Computation, published by Oxford University Press.