[10511] in cryptography@c2.net mail archive
RE: Cringely Gives KnowNow Some Unbelievable Free Press... (fwd)
daemon@ATHENA.MIT.EDU (bear)
Tue Feb 26 14:13:37 2002
Date: Tue, 26 Feb 2002 08:40:40 -0800 (PST)
From: bear <bear@sonic.net>
To: "Arnold G. Reinhold" <reinhold@world.std.com>
Cc: "Phillip H. Zakas" <pzakas@toucancapital.com>,
"'Eugene Leitl'" <Eugene.Leitl@lrz.uni-muenchen.de>,
"'Cryptography List'" <cryptography@wasabisystems.com>
In-Reply-To: <v04210107b8a140c9e530@[192.168.0.2]>
Message-ID: <Pine.LNX.4.40.0202260832330.18597-100000@newbolt.sonic.net>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
On Tue, 26 Feb 2002, Arnold G. Reinhold wrote:
>>I predict that Elliptic-Curve systems are about to become more
>>popular.
>>
>
>I'm not completely comfortable with Elliptic-Curve systems. The
>mathematics is relatively young and has seen a lot of progress.
Right. I'm not very comfortable with Elliptic-Curve yet, either.
I haven't been able to work out exactly how, but I have a gut
feeling that there may be some translation or transformation of
the Elliptic-Curve problem that simplifies to integer factoring,
and as a result I'm not comfortable with EC key lengths shorter
than factorable numbers. However, I'm just a hobby mathematician.
I'm going to let the real mathematicians pound on it for a decade
or so and see what they come up with.
>If we are going to have to upgrade OpenPGP standards in light of the
>Bernstein paper, I would suggest a standard that combines RSA, EC
>and, if possible, a third PK system whose algorithm is based on an
>apparently independent problem.
This is probably a good idea - but independent keys for those
systems are going to make the keys *long*. Still, disk space is
cheap now, so yeah, that's probably the way to go.
Isn't Elliptic-Curve patent-encumbered?
Bear
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@wasabisystems.com
