Simple Countermeasure to Cryptanalysis against Unified ECC Codes

  • 발행 : 2010.02.28

초록

As a countermeasure to simple power attack, the unified point addition codes for the elliptic curve cryptosystem were introduced. However, some authors proposed a different kind of power attacks to the codes. This power attack uses the observation that some internal operations in the codes behave differently for addition and doubling. In this paper, we propose a new countermeasure against such an attack. The basic idea of the new countermeasure is that, if one of the input points of the codes is transformed to an equivalent point over the underlying finite field, then the code will behave in the same manner for addition and doubling. The new countermeasure is highly efficient in that it only requires 27(n-1)/3 extra ordinary integer subtractions (in average) for the whole n-bit scalar multiplication. The timing analysis of the proposed countermeasure is also presented to confirm its SPA resistance.

키워드

참고문헌

  1. N. Koblitz, Elliptic Curve Cryptosystems, Mathematics Computation, vol. 48, 1987, pp. 203-209. https://doi.org/10.1090/S0025-5718-1987-0866109-5
  2. V. S. Miller, Use of Elliptic Curves in Cryptography, CRYPTO'85, LNCS, vol. 218, Springer-Verlag, 1986, pp. 417-426.
  3. J.-S. Coron, Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems, CHES'99, LNCS, vol.1717, Springer-Verlag, 1999, pp. 292-302.
  4. P. Kocher, J. Jaffe, and B. Jun, Differential Power Analysis, CRYPTO'99, LNCS, vol. 1666, Springer-Verlag, 1999, pp. 388-397.
  5. E. Brier, I. Dechi:ne, and M. Joye, Unified Point Addition Formulae for Elliptic Curve Cryptosystems, Embedded Cryptographic Hardware: Methodologies and Architectures, Nova Science Publishers, 2004, pp. 247-256.
  6. E. Brier and M. Joye, Weierstraf3 Elliptic Curves and Side-channel Attacks, PKC 2002, LNCS, vol. 2274, Springer-Verlag, 2002, pp. 335-345.
  7. D. Stebila and N. Theriault, Unified Point Addition Formulae and SideChannel Attacks, CHES 2006, LNCS, vol. 4249, Springer-Verlag, 2006, pp 354-368.
  8. C. Waiter, Simple Power Analysis of Unified Code for ECC Double and Add, CHES 2004, LNCS vol. 3156, Springer-Verlag, 2004, pp. 191-204.
  9. I. F. Blake, G. Seroussi and N. P. Smart, Elliptic Curves in Cryptography., Cambridge University Press, CRC Press, 1999.
  10. P. L. Montgomery, Speeding the Pollard and Elliptic Curve Methods of Factorization, Mathematics of Computation, 48,1987, pp. 243-264. https://doi.org/10.1090/S0025-5718-1987-0866113-7
  11. National Institute of Standards and Technology, Recommended Elliptic Curves for Federal Government Use, Appendix to FIPS 186-2, 2000.