Remote timing attacks are practical
Computer NetworksPublished 1 March 2005
David Brumley, Dan Boneh
Citations396
SJR quartileQ1
SJR score1.17
SNIP1.37
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
Timing attacks are usually used to attack weak computing devices such as smartcards. We show that timing attacks apply to general software systems. Specifically, we devise a timing attack against OpenSSL. Our experiments show that we can extract private keys from an OpenSSL-based web server running on a machine in the local network. Our results demonstrate that timing attacks against network servers are practical and therefore all security systems should defend against them.
Keywords
Computer Science
Choice Reviews OnlineHandbook of applied cryptography
10,469 Citations1997Menezes, Alfred J., Oorschot, Paul C. van +1 more
Lecture notes in computer scienceDifferential Power Analysis
7,163 Citations1999Paul Kocher, Joshua Jaffe +1 more
This paper examines specific methods for analyzing power consumption measurements to find secret keys from tamper resistant devices to find secret keys from tamper resistant devices.
Lecture notes in computer scienceTiming Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
4,245 Citations1996Paul Kocher
Mathematics of ComputationModular multiplication without trial division
2,357 Citations1985Peter L. Montgomery
A method for multiplying two integers modulo N while avoiding division by N, a representation of residue classes so as to speed modular multiplication without affecting the modular addition and subtraction algorithms.
Lecture notes in computer scienceOn the Importance of Checking Cryptographic Protocols for Faults
1,436 Citations1997Dan Boneh, Richard A. DeMillo +1 more
A sound pressure level meter adapted for use in monitoring noise levels, particularly for use by law enforcement agencies wherein the device includes means for providing a logarithmic indication of the root mean square value of ambient sound pressure levels.
Journal of CryptologySmall Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities
761 Citations1997Don Coppersmith
It is shown how to find sufficiently small integer solutions to a polynomial in a single variable modulo N, and to a Poole's inequality in two variables over the integers.
Lecture notes in computer scienceA Practical Implementation of the Timing Attack
263 Citations2000J.-F. Dhem, François Koeune +4 more
This work proposes several improvements on Kocher’s ideas, leading to a practical implementation that is able to break a 512-bit key in few hours, provided the authors are able to collect 300000 timing measurements.
Lecture notes in computer scienceA Timing Attack against RSA with the Chinese Remainder Theorem
124 Citations2000Werner Schindler
A new type of timing attack is introduced which enables the factorization of an RSA-modulus if the exponentiation with the secret exponent uses the Chinese Remainder Theorem and Montgomery's algorithm.
Lecture notes in computer scienceA Combined Timing and Power Attack
59 Citations2002Werner Schindler
The optimized version of the side-channel attack on the secret exponents of modular exponentiations can be adapted to other table methods, other multiplication algorithms and inexact timings and it is shown that the countermeasures proposed in [9] do not prevent the optimized attack if unsuitable parameters are chosen.
A Practical Implementation of the Timing Attack
42 Citations1998JF Dhem, J. -f. Dhem +10 more
This work proposes several improvements on Kocher's ideas, leading to a practical implementation that is able to break a 512-bit key in few hours, provided the authors are able to collect 300 000 timing measurements.
Lecture notes in computer scienceImproving Divide and Conquer Attacks against Cryptosystems by Better Error Detection / Correction Strategies
32 Citations2001Werner Schindler, François Koeune +1 more
A new (generic) error detection and correction strategy is introduced that is demonstrated at various examples, namely at a power attack, two timing attacks against RSA implementations with and without Chinese Remainder Theorem, and a timing attack against the future AES (Rijndael).