[Cryptography] List of Proven Secure Ciphers / Hashes

[Peter Gutmann]

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

>Translate your factoring instance into a SAT instance via a poly-time (or
>log-space) reduction.

Yeah, and now you're back to the how-to-travel-to-Mars problem:

1. Build a big rocket.
2. Round up some astronauts.
3. Fly to Mars.  QED.

The fact that you can state a solution doesn't mean that you can actually do
it.  I specifically chose SAT because of its everything-maps-to-SAT status,
but was trying to point out that having a SAT solver doesn't automatically
break RSA or DH or whatever.

Peter.