×

zbMATH — the first resource for mathematics

Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. (English) Zbl 1329.94070
Koblitz, Neal (ed.), Advances in cryptology – CRYPTO 1996. 16th annual international cryptology conference, Santa Barbara, CA, USA, August 18–22, 1996. Proceedings. Berlin: Springer (ISBN 3-540-61512-1/pbk). Lect. Notes Comput. Sci. 1109, 104-113 (1996).
Summary: By carefully measuring the amount of time required to perform private key operations, attackers may be able to find fixed Diffie-Hellman exponents, factor RSA keys, and break other cryptosystems. Against a vulnerable system, the attack is computationally inexpensive and often requires only known ciphertext. Actual systems are potentially at risk, including cryptographic tokens, network-based cryptosystems, and other applications where attackers can make reasonably accurate timing measurements. Techniques for preventing the attack for RSA and Diffie-Hellman are presented. Some cryptosystems will need to be revised to protect against the attack, and new protocols and algorithms may need to incorporate measures to prevent timing attacks.
For the entire collection see [Zbl 1066.94500].

MSC:
94A60 Cryptography
Software:
Blowfish; RSAREF
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] D. Chaum, ”Blind Signatures for Untraceable Payments,” \(Advances in Cryptology: Proceedings of Crypto 82\), Plenum Press, 1983, pp. 199-203. · Zbl 0521.94012
[2] W. Diffie and M.E. Hellman, ”New Directions in Cryptography,” \(IEEE Transactions on Information Theory\), IT-22, n. 6, Nov 1976, pp. 644-654. · Zbl 0435.94018 · doi:10.1109/TIT.1976.1055638
[3] X. Lai, \(On the Design and Security of Block Ciphers\), ETH Series in Information Processing, v. 1, Konstanz: Hartung-Gorre Verlag, 1992.
[4] National Bureau of Standards, ”Data Encryption Standard,” Federal Information Processing Standards Publication 46, January 1977.
[5] National Institute of Standards and Technology, ”Digital Signature Standard,” Federal Information Processing Standards Publication 186, May 1994.
[6] P.L. Montgomery, ”Modular Multiplication without Trial Division,” \(Mathematics of Computation\), v. 44, n. 170, 1985, pp. 519-521. · Zbl 0559.10006 · doi:10.2307/2007970
[7] R.L. Rivest, ”The RC5 Encryption Algorithm,” \(Fast Software Encryption: Second International Workshop, Leuven, Belgium, December 1994, Proceedings\), Springer-Verlag, 1994, pp. 86-96. · Zbl 0939.94553
[8] R.L. Rivest, A. Shamir, and L.M. Adleman, ”A method for obtaining digital signatures and public-key cryptosystems,” \(Communications of the ACM\), 21, 1978, pp. 120-126. · Zbl 0368.94005 · doi:10.1145/359340.359342
[9] P.R. Rogaway and D. Coppersmith, ”A Software-Optimized Encryption Algorithm,” \(Fast Software Encryption: Cambridge Security Workshop, Cambridge, U.K., December 1993, Proceedings\), Springer-Verlag, 1993, pp. 56-63. · Zbl 0943.94519
[10] RSA Laboratories, ”RSAREF: A Cryptographic Toolkit,” Version 2.0, 1994, available via FTP from rsa.com.
[11] B. Schneier, ”Description of a New Variable-Length Key, 64-bit Block Cipher (Blowfish),” \(Fast Software Encryption: Second International Workshop, Leuven, Belgium, December 1994, Proceedings\), Springer-Verlag, 1994, pp. 191-204. · Zbl 0943.94523
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.