Distinguishing Exponent Digits by Observing Modular Subtractions

  • Colin D. Walter
  • Susan Thompson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2020)

Abstract

We analyse timing variations in an implementation of modular multiplication which has certain standard characteristics. This shows that squarings and multiplications behave differently when averaged over a number of random observations. Since power analysis can reveal such data, secret RSA exponents can be deduced if a standard square and multiply exponentiation algorithm is used. No knowledge of the modulus or input is required to do this. The technique generalises to the m-ary and sliding windows exponentiation methods since different multipliers can be distinguished. Moreover, only a small number of observations (independent of the key size and well under 1k) are required to perform the cryptanalysis successfully. Thus, if the modular multiplication algorithm cannot be made any safer, the exponent must be modified on every use.

Keywords

Exponentiation modular multiplication Montgomery multiplication RSA cryptosystem m-ary method sliding windows timing attack power analysis 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. V. Borovik & C. D. Walter, A Side Channel Attack on Montgomery Multiplication, private technical report, Datacard platform7 seven, 24th July 1999.Google Scholar
  2. 2.
    J.-F. Dhem, F. Koeune, P.-A. Leroux, P. Mestré, J.-J. Quisquater & J.-L. Willems, A practical implementation of the Timing Attack, Proc. CARDIS 1998, Lecture Notes in Computer Science, 1820, Springer-Verlag, 2000, 175–190.Google Scholar
  3. 3.
    D. E. Knuth, The Art of Computer Programming, vol. 2, Seminumerical Algorithms, 2nd edition, Addison-Wesley, 1981.Google Scholar
  4. 4.
    Ç. K. Koç, High Radix and Bit Recoding Techniques for Modular Exponentiation, International J. of Computer Mathematics, 40 (1991) no. 3–4, 139–156.CrossRefMATHGoogle Scholar
  5. 5.
    P. Kocher, Timing attack on implementations of Diffie-Hellman, RSA, DSS, and other systems, Proc. Crypto 96 (N. Koblitz, ed.). Lecture Notes in Computer Science, 1109, Springer-Verlag, 1996, 104–113.Google Scholar
  6. 6.
    P. L. Montgomery, Modular multiplication without trial division, Mathematics of Computation, 44 (1985), no. 170, 519–521.MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    R. L. Rivest, A. Shamir and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Comm. ACM, 21 (1978), 120–126.MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    W. Schindler, A Timing Attack against RSA with Chinese Remainder Theorem, Cryptographic Hardware and Embedded Systems (CHES 2000), Christof Paar & Çetin Koç, editors, LNCS 1965, Springer-Verlag, 2000, to appear.CrossRefGoogle Scholar
  9. 9.
    C. D. Walter, Montgomery Exponentiation Needs No Final Subtractions, Electronics Letters, 35, no. 21, October 1999, 1831–1832.CrossRefGoogle Scholar
  10. 10.
    C. D. Walter, An Overview of Montgomery’s Multiplication Technique: How to make it Smaller and Faster, Cryptographic Hardware and Embedded Systems (CHES’ 99), C. Paar & ç. Koç, editors, LNCS 1717, Springer-Verlag, 1999, 80–93.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Colin D. Walter
    • 1
  • Susan Thompson
    • 1
  1. 1.Datacard platform 7sevenUK

Personalised recommendations