by Thomas Ditsworth

While many people rely on the internet for everything from casual emails to secure banking transactions, most don’t understand the security behind it. In this podcast, we will discuss a computer science problem that is the basis behind our most current methods of encryption. In turn, we will explore where the encryption is used, the math behind why it is so secure, and how further innovation could put it all in jeopardy.

References: 

Hackerdashery. (2014, August 26). P vs. NP and the Computational Complexity Zoo

Hardesty, L. (2009, October 29). Explained: P vs. NP. MIT News | Massachusetts

Lake, J. (2021, March 18). What is RSA encryption and how does it work? Comparitech. https://www.comparitech.com/blog/information-security/rsa-encryption/

Pavlus, J. (2020, April 2). What Does ‘P vs. NP’ Mean for the Rest of Us? MIT

The Millennium Prize Problems | Clay Mathematics Institute. (2021, April 19). Clay

Watson, J. (2017, March 16). Public key cryptography: What is it, how it works and how to use it in email and file encryption. Comparitech. https://www.comparitech.com/blog/vpn-privacy/what-is-public-key-cryptography/

Audio From

Royalty Free Music by Bensound | Stock Music. (n.d.). BenSound. Retrieved March 31, 2021, from https://www.bensound.com/

For more information check out the following links to other resources about topics discussed in this podcast:

Image: Screenshot from “P vs. NP and the Computational Complexity Zoo.”