[10516] in cryptography@c2.net mail archive
Re: Cringely Gives KnowNow Some Unbelievable Free Press... (fwd)
daemon@ATHENA.MIT.EDU (Berke Durak)
Wed Feb 27 12:51:15 2002
Date: Tue, 26 Feb 2002 23:14:51 +0100
From: Berke Durak <berke@altern.org>
To: bear <bear@sonic.net>
Cc: cryptography@wasabisystems.com
Message-ID: <20020226231451.A29000@gogol.zorgol>
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Disposition: inline
In-Reply-To: <Pine.LNX.4.40.0202260832330.18597-100000@newbolt.sonic.net>; from bear@sonic.net on Tue, Feb 26, 2002 at 08:40:40AM -0800
On Tue, Feb 26, 2002 at 08:40:40AM -0800, bear wrote:
> >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,
[...]
Plus, I'd remind everyone that no-one managed to prove that breaking
RSA is as hard as factoring (cf. ``Breaking RSA may be easier than
factoring'' D.Boneh & R.Venkatesan, where they show that if you manage
to show that breaking RSA is algebraically as hard as factoring,
then you've got for free a factoring algorithm).
--
Berke Durak
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@wasabisystems.com
