# Timeline for Why hasn't there been an encryption algorithm that is based on the known NP-Hard problems?

### Current License: CC BY-SA 3.0

12 events
when toggle format what by license comment
Aug 12 '21 at 13:35 comment @Acccumulation That's switching the computation model (including randomization), IMHO in a not helpful way. Yes, brute force always works but is prohibitive. The problem with easy instances is that given the public information, deterministic solvers can find the key quickly. That would make the best case easier than guessing, which we should try to avoid.
Aug 11 '21 at 23:08 comment @Raphael The best case scenario (at least from the point of view of the person trying to break the encryption) is that they randomly guess a key that happens to be correct. There's no way for an encryption system to have the best-case hardness be more difficult than the knows-the-key hardness.
Feb 10 '14 at 13:37 comment @Raphael, it should be enough if the probability to get an undesirable "good" case is small enough. If it's say smaller than the probability to guess the correct key of a desirable "bad" case, this risk should be considered acceptable IMHO.
May 4 '12 at 22:55 history edited
unified format of "P != NP"
S Mar 25 '12 at 15:00 history
Mar 14 '12 at 13:49 comment moreover, we should be able to generate hard instances in reasonable time. In short, we need much more than just $\sf{NP\text{-}hard}$ness.