The mathematical puzzle that could render all modern passwords useless
In short: If certain complex problems are actually easy to solve, our entire digital security infrastructure could collapse. This video explores P vs. NP, the most significant unsolved question in computer science.
The P vs. NP problem asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by one.
Currently, modern cryptography relies on the assumption that certain puzzles are 'hard' to solve but 'easy' to check. If it were proven that P equals NP, these puzzles would become trivial to crack, potentially making even the strongest passwords easy for hackers to bypass. The video features a team of researchers, including Kevin Bealer and Jacob, exploring why this theoretical distinction is the cornerstone of computational complexity.
Opens the Intellect+ feed with this card first. Swipe up for the next one.
Sources
- Summary by Intellect · source: This Problem Could Break Cryptography
To cite this card, link to https://intellectplus.co.uk/app/science-this-problem-could-break-cryptography.
How we source, check and correct cards: Editorial standards.
General information, not professional advice. Spotted an error? Flag the card or see corrections and complaints.
Intellect Plus is a visual educational discovery platform for exploring fascinating facts and ideas. Brain Food, Not Brain Rot. What is Intellect Plus?
Related
More in Science · Latest · A–Z · All topics
