The Million Dollar Problem That Could Break Cryptography - SciTechDaily

P versus NP Usually, you can verify a solution to a problem. Whether it’s using multiplication for division or plugging the answer in for a variable, math teachers tell you to check your work using your answer in every school math class. But let's say you can…

The P vs NP problem is one of the most difficult problems in theoretical computer science.  P versus NP Usually, you can verify a solution to a problem. Whether its using multiplication for divisio… [+2726 chars]

full article...