[146497] in cryptography@c2.net mail archive
Re: [Cryptography] NSA and cryptanalysis
daemon@ATHENA.MIT.EDU (James A. Donald)
Sat Aug 31 21:18:41 2013
X-Original-To: cryptography@metzdowd.com
Date: Sun, 01 Sep 2013 11:11:50 +1000
From: "James A. Donald" <jamesd@echeque.com>
To: cryptography@metzdowd.com
In-Reply-To: <52222F98.7060704@sonic.net>
Reply-To: jamesd@echeque.com
Errors-To: cryptography-bounces+crypto.discuss=bloom-picayune.mit.edu@metzdowd.com
On 2013-09-01 4:02 AM, Ray Dillinger wrote:
> On 08/30/2013 08:10 PM, Aaron Zauner wrote:
>
>> I read that WP report too. IMHO this can only be related to RSA
>> (factorization, side-channel attacks).
>
> I have been hearing rumors lately that factoring may not in fact be as
> hard
> as we have heretofore supposed. Algorithmic advances keep eating into
> RSA
> keys, as fast as hardware advances do.
So far, not much affect on elliptic keys.
Except that all elliptic keys of the extremely useful gap-diffie-hellman
group are potentially subject to techniques analogous to those that are
attacking RSA.
_______________________________________________
The cryptography mailing list
cryptography@metzdowd.com
http://www.metzdowd.com/mailman/listinfo/cryptography
