[Cryptography] List of Proven Secure Ciphers / Hashes

[Peter Gutmann]

"R. Hirschfeld" <ray at unipay.nl> writes:

>Showing P = NP (unlikely!) might indeed have little immediate impact on
>crypto practice.  It depends on the nature of the proof.  If it's by giving a
>practical efficient poly-time algorithm for an NP-complete problem, that's a
>game changer.

OK, I'll change the scenario slightly:

  The aliens still land tomorrow and announce "There was another gunman on the
  grassy knoll, we were responsible for the Mary Celeste (sorry about that)",
  but this time they finish with "here's a way of efficiently solving SAT.
  See you in another billion years or whenever they stop re-running Cheers,
  whichever comes sooner".

Same question as last time.

Peter.