[Cryptography] List of Proven Secure Ciphers / Hashes

[Tom Mitchell]

On Wed, Sep 10, 2014 at 6:13 AM, Peter Gutmann <pgut001 at cs.auckland.ac.nz>
wrote:

> "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.
> <http://www.metzdowd.com/mailman/listinfo/cryptography>
>


This travel to Mars problem is incomplete...
Travel to Mars is hard but the return trip is vastly harder
and returning with an answer or answers is important.

It is not just throw weight of the return craft and fuel for that craft
it is the geometry of planets spinning around the sun and more
that make the layers of the trip to mars problem  interesting.




-- 
  T o m    M i t c h e l l
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.metzdowd.com/pipermail/cryptography/attachments/20140915/daaf757e/attachment.html>