Die zeitabhängige Unsicherheit der Sicherheit

From: David Brumley <dbrumley@stanford.edu>

[...]
We found that we can recover an RSA secret from OpenSSL using
anywhere from only 300,000 to 1.4 million queries.We demonstrated
our attack was pratical by successfully launching an attack against
Apache + mod_SSL and stunnel on the local network. Our results show
that timing attacks are practical against widely-deploy servers
running on the network.
[...]

The results indicate that all crypto implementations should defend
against timing attacks.

This paper was submitted to Usenix security 03.
The link to the paper is here:
http://crypto.stanford.edu/~dabo/abstracts/ssl-timing.html

-David Brumley