EPISODE · Dec 15, 2017 · 35 MIN
Complexity and Cryptography
from Data Skeptic · host Kyle Polich with guest Tim Henderson
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.
Embed this episode
Ready to play
Complexity and Cryptography
0:00
35:53
1×
No transcript for this episode yet
Similar Episodes
No similar episodes found.
Similar Podcasts
AI Daily News Podcast
Really Easy AI
AI Daily News: Your premier source for cutting-edge artificial intelligence updates! Dive into the world of machine learning, deep learning, and data science with our daily tech briefings. From neural networks to natural language processing, we cover groundbreaking AI research, innovative applications, and industry trends. Explore the latest in computer vision, robotics, autonomous systems, and the Internet of Things. Stay informed on AI ethics, machine learning algorithms, and the transformative impact of AI on business, healthcare, and society. https://www.youtube.com/@AINewsFresh
Gytis Tech Podcast
Inretio
Data professional and tech enthusiast from Lithuania, covering tech topics including open source software, smart home automation, web development, automotive diagnostics and more.
Frequently Asked Questions
How long is this episode of Data Skeptic?
This episode is 35 minutes long.
When was this Data Skeptic episode published?
This episode was published on December 15, 2017.
Can I download this Data Skeptic episode?
Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!