[144595] in cryptography@c2.net mail archive
Re: 112-bit prime ECDLP solved
daemon@ATHENA.MIT.EDU (James A. Donald)
Thu Jul 16 08:27:24 2009
Date: Thu, 16 Jul 2009 16:31:56 +1000
From: "James A. Donald" <jamesd@echeque.com>
Reply-To: jamesd@echeque.com
To: Tanja Lange <tanja@hyperelliptic.org>
CC: cryptography@metzdowd.com
In-Reply-To: <20090714230720.GH20308@cph.win.tue.nl>
Tanja Lange wrote:
> So with about 1 000 000 USD and a full year you would get 122 bits
> already now and agencies have a bit more budget than this! Furthermore,
> the algorithm parallelizes extremely well and can handle a batch of 100
> targets at only 10 times the cost.
No it cannot handle a bunch of a hundred targets at only ten times the
cost. It is already parallelized. A hundred targets is a hundred times
the cost.
But let us not think small. Suppose the president says "Break James
Donald's key. I don't care how much it costs. The sky is the limit"
and they devote the entire US gross national product for a year to
breaking James Donald's key in a year.
Then they can break a 170 bit key.
But I rather doubt that they will.
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
