The $1,000,000 question about P vs NP could solve many questions of Internet security
If the answer to that is yes, then P does not equal NP. The P versus NP problem is a major unsolved problem in computer science. It was essentially first mentioned in a 1956 letter written by Kurt Godel to John von Neumann. Godel asked whether a certain NP-complete problem could be solved in quadratic or linear time. If solved, it could open new doors for providing security to the Internet....