Want to create an interactive transcript for this episode?
Podcast: Data Skeptic
Episode: [MINI] Is the Internet Secure?
Description: This episode explores the basis of why we can trust encryption. Â Suprisingly, a discussion of looking up a word in the dictionary (binary search) and efficiently going wine tasting (the travelling salesman problem) help introduce computational complexity as well as the P ?= NP question, which is paramount to the trustworthiness RSA encryption. With a high level foundation of computational theory, we talk about NP problems, and why prime factorization is a difficult problem, thus making it a great basis for the RSA encryption algorithm, which most of the internet uses to encrypt data. Â Unlike the encryption scheme Ra...