Complexity and Cryptography

This week, our host Kyle Polich is joined by guest Tim Henderson from Google to talk about the computational complexity foundations of modern cryptography and the complexity issues that underlie the field. A key question that arises during the discussion is whether we should trust the security of modern cryptography.

Guest

Tim Henderson: Tim Henderson is a software engineer and researcher and is currently at Google. He specializes in testing, fault localization, duplicate code detection, program analysis, graph mining, and databases. Dr. Henderson received a Ph.D. at Case Western Reserve University and was advised by Professor Andy Podgurksi.