11 min listen
Complexity and Cryptography
FromData Skeptic
ratings:
Length:
36 minutes
Released:
Dec 15, 2017
Format:
Podcast episode
Description
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.
Released:
Dec 15, 2017
Format:
Podcast episode
Titles in the series (100)
[MINI] Data Provenance: This episode introduces a high level discussion on the topic of Data Provenance, with more MINI episodes to follow to get into specific topics. Thanks to listener Sara L who wrote in to point out the Data Skeptic Podcast has focused alot... by Data Skeptic