Skip to main content
Log in

SPA-resistant binary exponentiation with optimal execution time

  • Regular Paper
  • Published:
Journal of Cryptographic Engineering Aims and scope Submit manuscript

Abstract

Straightforward implementations of binary exponentiation algorithms make the cryptographic system vulnerable to side-channel attacks; specifically, to simple power analysis (SPA) attacks. Solutions proposed so far introduce a considerable performance penalty. In this paper, we present a new method that implements an SPA-resistant binary exponentiation exhibiting optimal execution time at the cost of a small amount of storage—\({O(\sqrt{\ell})}\), where ℓ is the bit length of the exponent. The technique is optimal in the sense that it adds SPA-resistance to an underlying binary exponentiation algorithm while introducing zero computational overhead. Furthermore, we show that for practical applications, the same optimal execution time can be achieved with much less storage space, without noticeably sacrificing security or any other aspect of the cryptosystem’s performance. We also discuss the possibility of our method being implemented in a way that a certain level of resistance against differential power analysis may be obtained.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Diffie W., Hellman M.E.: New directions in cryptography. IEEE Trans. Inf. Theory IT-22(6), 644–654 (1976)

    Article  MathSciNet  Google Scholar 

  2. Rivest R., Shamir A., Adleman L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120–126 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  3. ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory IT-31(4) (1985)

  4. Koblitz N.: Elliptic curve cryptosystems. Math. Comput. 48(177), 203–209 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  5. Miller, V.S.: Use of elliptic curves in cryptography. Adv. Cryptol. (1986)

  6. Gordon D.M.: A survey of fast exponentiation methods. J. Algorithms 27(1), 129–146 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kocher, P., Jaffe, J., and Jun, B.: Differential power analysis. In: Advances in Cryptology—CRYPTO’ 99, pp. 388–397 (1999)

  8. Arno S., Wheeler F.: Signed digit representations of minimal hamming weight. IEEE Trans. Comput. 42(8), 1007–1010 (1993)

    Article  Google Scholar 

  9. Menezes A.J., van Oorschot P.C., Vanstone S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)

    Book  Google Scholar 

  10. Coron, J.-S.: Resistance against differential power analysis for elliptic curve cryptosystems. In: Workshop on Cryptographic Hardware and Embedded Systems (1999)

  11. Joye M.: Recovering lost efficiency of exponentiation algorithms on smart cards. Electron. Lett. 38(19), 1095–1097 (2002)

    Article  Google Scholar 

  12. Chevallier-Mames B., Ciet M., Joye M.: Low-cost solutions for preventing simple side-channel analysis: side-channel atomicity. IEEE Trans. Comput. 53(6), 760–768 (2004)

    Article  Google Scholar 

  13. Hankerson D., Menezes A., Vanstone S.: Guide to elliptic curve cryptography. Springer, Berlin (2004)

    MATH  Google Scholar 

  14. Ha, J.C., Moon, S.J.: Randomized signed-scalar multiplication of ECC to resist power attacks. In: Workshop on Cryptographic Hardware and Embedded Systems (2002)

  15. Sun D.-Z., Huai J.-P., Sun J.-Z., Cao Z.-F.: An efficient modular exponentiation algorithm against simple power analysis attacks. IEEE Trans. Consumer Electron. 53(4), 1718–1723 (2007)

    Article  MATH  Google Scholar 

  16. Cover T.M., Thomas J.A.: Elements of Information Theory, 2nd edn. Wiley-Interscience, New York (2006)

    MATH  Google Scholar 

  17. Papoulis A., Pillai U.S.: Probability, Random Variables and Stochastic Processes, 4th edn. McGraw-Hill, New York (2002)

    Google Scholar 

  18. Abramowitz, M., Stegun, I.A. (eds): Handbook of Mathematical Functions. Dover Publications, New York (1965)

    Google Scholar 

  19. Butenhof D.R.: Programming with POSIX Threads. Addison-Wesley, Reading (1997)

    Google Scholar 

  20. Hasan M.A.: Power analysis attacks and algorithmic approaches to their countermeasures for Koblitz curve cryptosystems. IEEE Trans. Comput. 50, 1071–1083 (2001)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Carlos Moreno.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Moreno, C., Hasan, M.A. SPA-resistant binary exponentiation with optimal execution time. J Cryptogr Eng 1, 87–99 (2011). https://doi.org/10.1007/s13389-011-0008-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13389-011-0008-9

Keywords

Navigation