Warp wrote:
> 
>   The vast majority of modern cryptography uses algorithms which have been
> proven to be NP, and their security relies on the assumption that P != NP.
> 
>   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.
> 

I was sort of asking if you actually had any specific examples of 
commonly used encryption algorithms which are believed to be NP-hard to 
crack, because the ones I can think of aren't and thus wouldn't 
necessarily be safe even if P!=NP.

Post a reply to this message