[Cryptography] List of Proven Secure Ciphers / Hashes

[John Levine]

>responsible for the Mary Celeste (sorry about that), oh, and also P = NP.  See
>you in another billion years".
>
>How does this affect practical usage of PKC in any conceivable way?

Perhaps people expect that if P=NP, there will be a constructive proof
of a polynomial algorithm for an NP complete problem.

If it's a more abstract proof that such an algorithm must exist,
without telling us what it is, I agree that the practical effect will
be nil.

R's,
John