[18465] in cryptography@c2.net mail archive
Re: MIT talk: Special-Purpose Hardware for Integer Factoring
daemon@ATHENA.MIT.EDU (Victor Duchovni)
Thu Sep 15 10:32:43 2005
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
Date: Wed, 14 Sep 2005 14:06:47 -0400
From: Victor Duchovni <Victor.Duchovni@MorganStanley.com>
To: cryptography@metzdowd.com
Mail-Followup-To: cryptography@metzdowd.com
In-Reply-To: <20050914162939.53C083BFF99@berkshire.machshav.com>
On Wed, Sep 14, 2005 at 12:29:39PM -0400, Steven M. Bellovin wrote:
> Taken together, these works have reduced the cost of factoring by many
> orders of magnitude, making it feasible, for example, to factor
> 1024-bit integers within one year at the cost of about US$1M (as
> opposed to the trillions of US$ forecasted previously). This talk will
> survey these results, emphasizing the underlying general ideas.
>
> Joint works with Adi Shamir, Arjen Lenstra, Willi Geiselmann, Rainer
> Steinwandt, Hubert K?pfer, Jim Tomlinson, Wil Kortsmit, Bruce Dodson,
> James Hughes and Paul Leyland.
>
Is it politically correct to not cite DJB in this context (perhaps
it is since the talk invitation is not the paper, but the ommision
really caught my attention).
--
/"\ ASCII RIBBON NOTICE: If received in error,
\ / CAMPAIGN Victor Duchovni please destroy and notify
X AGAINST IT Security, sender. Sender does not waive
/ \ HTML MAIL Morgan Stanley confidentiality or privilege,
and use is prohibited.
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
