[145696] in cryptography@c2.net mail archive
Re: 2048-bit RSA keys
daemon@ATHENA.MIT.EDU (James A. Donald)
Tue Aug 17 22:33:14 2010
Date: Wed, 18 Aug 2010 12:13:21 +1000
From: "James A. Donald" <jamesd@echeque.com>
Reply-To: jamesd@echeque.com
To: Jonathan Katz <jkatz@cs.umd.edu>
CC: Paul Hoffman <paul.hoffman@vpnc.org>, Ray Dillinger <bear@sonic.net>,
cryptography@metzdowd.com
In-Reply-To: <Pine.GSO.4.64.1008170143450.1841@ringding.cs.umd.edu>
On 2010-08-17 3:46 PM, Jonathan Katz wrote:
> Many on the list may already know this, but I haven't seen it mentioned
> on this thread. The following paper (that will be presented at Crypto
> tomorrow!) is most relevant to this discussion:
> "Factorization of a 768-bit RSA modulus",
> http://eprint.iacr.org/2010/006
Which tells us that ordinary hobbyist and academic efforts will not be
able to factor a 1024 bit RSA modulus by brute force until around 2015
or so - but dedicated hardware and so forth might be able to do it now.
What is the latest news on cracking by ECC by brute force?
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
