SciShow: This Problem Could Break Cryptography

Teacher or professor: SciShow
Subject: Science
Content of the Lesson: Go to http://Brilliant.org/SciShow to try their Computer Science Fundamentals course. The first 200 subscribers get 20% off an annual Premium subscription. What if, no matter how strong your password was, a hacker could crack it just as easily as you can type it? In fact, what if all sorts of puzzles we thought were hard turned out to be easy? Mathematicians call this problem P vs. NP, it is perhaps the single most important question in computer science today. Hosted by: Hank Green SciShow has a spinoff podcast! It's called SciShow Tangents. Check it out at http://www.scishowtangents.org ---------- Support SciShow by becoming a patron on Patreon: https://www.patreon.com/scishow ---------- Huge thanks go to the following Patreon supporters for helping us keep SciShow free for everyone forever: Kevin Bealer, Jacob, KatieMarie Magnone, D.A. Noe, Charles Southerland, Christopher R Boucher, Alex Hackman, Matt Curls, Adam Brainard, Scott Satovsky Jr, Sam Buck, Avi Yashchin, Ron Kakar, Chris Peters, Kevin Carpentier, Patrick D. Ashmore, Piya Shedden, Sam Lutfi, charles george, Greg ---------- Looking for SciShow elsewhere on the internet? Facebook: http://www.facebook.com/scishow Twitter: http://www.twitter.com/scishow Tumblr: http://scishow.tumblr.com Instagram: http://instagram.com/thescishow ---------- Sources: https://mathvault.ca/math-glossary/#algo https://www.cs.cmu.edu/~adamchik/15-121/lectures/Algorithmic%20Complexity/complexity.html https://stackoverflow.com/questions/7055652/real-world-example-of-exponential-time-complexity http://www.cs.ucc.ie/~dgb/courses/toc/handout25.pdf http://news.mit.edu/2009/explainer-pnp https://www.scottaaronson.com/papers/pnp.pdf https://www.scottaaronson.com/blog/?p=122 http://people.cs.uchicago.edu/~fortnow/papers/pnp-cacm.pdf


Click here to view video on YouTube.