Re:Remote Timing Attacks Are Practical
by tylerni7 on Sunday July 24, 2011 @03:15PM
(#2800100)
Just so everyone knows, this specific attack is rather old. Modern versions of the RSA algorithm use blinding to specifically prevent this, which causes the RSA calculations to effectively be performed on random data.
There has also recently been a published timing attack regarding elliptic curve signatures, and there are some older papers about AES's vulnerability to timing attacks due to cache misses when using S-boxes. So while this paper specifically isn't a viable attack today, it is still relevant.
Re:Remote Timing Attacks Are Practical
by tptacek on Saturday July 23, 2011 @02:56PM
(#2797520)
In fact, the attacks have gotten much better since then; for instance, see Crosby & Wallach's paper on using statistical filters to establish nanosecond timing bounds on "local" (ie, cross-datacenter) networks:
Re:Remote Timing Attacks Are Practical
by patio11 on Saturday July 23, 2011 @01:38PM
(#2797361)
It is a novel class of attacks, and bites many people squarely on the hindquarters. For example, every available Java OpenID implementation was timable back in 2010.
There has also recently been a published timing attack regarding elliptic curve signatures, and there are some older papers about AES's vulnerability to timing attacks due to cache misses when using S-boxes. So while this paper specifically isn't a viable attack today, it is still relevant.
That doesn't change the importance of securing against timing side-channel attacks, however.
http://www.cs.rice.edu/~dwallach/pub/crosby-timing2009.pdf