Answer to thorny question could unlock internet security
By Tom Fleischman for the Cornell Chronicle
Is it easier to check that a solution to a problem is correct than it is to solve the problem?
The question – known as the “NP versus P” problem – is the deepest fundamental problem in computer science and cryptography, lying at the heart of whether any internet data can ever be truly private.
