|
![](/i/fill.gif) |
On 2010-08-10 01:27, Warp wrote:
> If P != NP indeed is correct, then it's certain that no algorithm can
> exist that cracks an NP encryption in polynomial time. Not now, nor any
> time in the future.
You mean 'certain that no algorithm can brute-force *all combinations*
of an NP encryption in polynomial time.' Merely cracking is somewhat
more trivial, since you (usually) don't need to go through every
possibility.
--
Tim Cook
http://empyrean.freesitespace.net
Post a reply to this message
|
![](/i/fill.gif) |