cryptoanarchy.wiki

Arise, you have nothing to lose but your barbed wire fences!

1995-02-13 - Re: Factoring - State of the Art and Predictions

Header Data

From: Zachary <zachary@pentagon.io.com>
To: schneier@chinet.chinet.com
Message Hash: eae290cf888d8331fec462f4da54b0796e130074dac25fa7c380cbdd25c65256
Message ID: <199502130012.SAA17341@pentagon.io.com>
Reply To: <m0rdnqt-000k5xC@mailbox.mcs.com>
UTC Datetime: 1995-02-13 00:12:48 UTC
Raw Date: Sun, 12 Feb 95 16:12:48 PST

Raw message

From: Zachary  <zachary@pentagon.io.com>
Date: Sun, 12 Feb 95 16:12:48 PST
To: schneier@chinet.chinet.com
Subject: Re: Factoring - State of the Art and Predictions
In-Reply-To: <m0rdnqt-000k5xC@mailbox.mcs.com>
Message-ID: <199502130012.SAA17341@pentagon.io.com>
MIME-Version: 1.0
Content-Type: text/plain



This touches on something I was thinking the other day:  Most
cryptosystems that we seem to use are based on the assumption that
factoring large numbers is a Hard Problem.  Isn't this putting all our
eggs in one basket?  Are there other Hard Problems crypto systems can be
based on?  In the ludicrous case, suppose Eve is visited by aliens and
given a black box that would instantly factor a number irrelevant of its
size... how much of current cryptography would this device invalidate? 
I'm no crypto-expert, so I don't know... but surely there are other hard
problems in the universe that we can base crypto on...

 --Zachary

Thread