Data Skeptic
Data Skeptic
Kyle Polich
Complexity and Cryptography
35 minutes Posted Dec 15, 2017 at 4:00 pm.
0:00
35:53
Download MP3
Show notes

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.