[Cryptography] List of Proven Secure Ciphers / Hashes

[R. Hirschfeld]

> From: Jerry Leichter <leichter at lrw.com>
> Date: Fri, 5 Sep 2014 16:18:02 -0400

> Since we do cryptography with a fixed size parameter, and we want "almost all" - probably "all" - of our particular uses of it to be hard, the P and NP classes are simply irrelevant.

Even though they are defined in terms of worst-case rather than
average-case complexity, I wouldn't say that P and NP are irrelevant.
If P = NP then there are no one-way functions, and no hard on average
problems (in NP).

Ray