Links @maniacalmoonx Newly discovered info ( for me) on how I am hacked /Timing Attack

http://www.springer.com

Practical Implementation of the Timing Attack

Part of the Lecture Notes in Computer Science book series (LNCS,volume 1820)

When the running time of a cryptographic algorithm is non-constant, timing measurements can leak information about the secret key. This idea, first publicly introduced by Kocher, is developed here to attack an earlier version of the CASCADE smart card. We propose several improvements on Kocher’s ideas, leading to a practical implementation that is able to break a 512-bit key in few hours, provided we are able to collect 300000 timing measurements (128-bit keys can be recovered in few seconds using a personal computer and less than 10000 samples). We therefore show that the timing attack represents an important threat against cryptosystems, which must be very seriously taken into account.

Keywords

  • timing attack
  • cryptonalysis
  • RSA
  • smart card

This is a preview of subscription content, access via your institution.

USD   29.95Price excludes VAT (USA)

Buy ChaptereBookUSD   84.99Softcover BookUSD   109.00

Learn about institutional subscriptions

Unable to display preview. Download preview PDF.

References

  1. Cascade (Chip Architecture for Smart CArds and portable intelligent DEvices). Project funded by the European Community, see http://www.dice.ucl.ac.be/crypto/cascade
  2. Dhem, J.F.: Design of an efficient public-key cryptographic library for RISC- based smart cards. PhD thesis, Université catholique de Louvain – UCL Crypto Group – Laboratoire de microélectronique (DICE) (May 1998)Google Scholar 
  3. Kocher, P.: Timing attacks on implementations of diffie-hellman, RSA, DSS, and other systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 104–113. Springer, Heidelberg (1996)Google Scholar 
  4. Leroux, P.-A.: Timing cryptanalysis: Breaking security protocols by measuring transaction times. Master’s thesis, Université catholique de Louvain – UCL Crypto Group (June 1998) Google Scholar 
  5. Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. In: Proc. Communications of the ACM, vol. 21, pp. 120–126. ACM Press, New York (1978)Google Scholar 
  6. Siegel, S.: Nonparametric Statistics. McGraw-Hill, New York (1956)MATH Google Scholar 
  7. Willems, J.-L.: Timing attack of secured devices (in French). Masters thesis, Université catholique de Louvain – UCL Crypto Group (June 1998) Google Scholar 

Download references

%d bloggers like this: