Data Skeptic

Complexity and Cryptography

Dec 15, 2017 · 35 min · 34.4 MB
0:00-35:53

Streams straight from the publisher. podnod never proxies or re-hosts episode audio.

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.