Complexity and Cryptography
Data Skeptic · Kyle Polich with guest Tim Henderson
December 15, 201735m 53s
Audio is streamed directly from the publisher (pscrb.fm) as published in their RSS feed. Play Podcasts does not host this file. Rights-holders can request removal through the copyright & takedown page.
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.