Darren New <dne### [at] san rr com> wrote:
> It is. The problem is that you don't want it to be NP-hard for *everyone*.
> You only want it NP-hard for people who don't know the key.
Well, by definition an answer to an NP problem can be verified in
polynomial time.
--
- Warp
Post a reply to this message
|