The Key to Every Lock
Pretty much every security system of the digital age is rooted on a mathematical assumption , that certain classes of problems will take forever to solve (even by the fastest classical computers of the future, but not quantum computers) while at the same time any solution can be checked very quickly. A maze is a good example of such problems: depending on complexity and size, finding the path from A to B could take forever, but any solution can be checked very fast (in comparison). Here is the risk: what if that assumption is wrong ? What if a generic solution does exist to solve such problems quickly? In fact, there is a $1 million reward for anyone who can prove whether or not this assumption is correct (in mathematical lingo, this is called the “ P versus NP problem ”). In an episode of Sherlock , the modernized (and awesome) BBC version of the detective, his arch-enemy, James Moriarty says he has found a way to break into any security system anywhere in the world: “I c...