2 ms·
While all problems that are NP-hard (to be pedantic different from just NP) have that property, for crypto you want things to be uniformly hard (i.e. a randomly
by bawolff 6y ago
While all problems that are NP-hard (to be pedantic different from just NP) have that property, for crypto you want things to be uniformly hard (i.e. a randomly generated instance is hard). That's a much rarer property.