DOI QR코드

DOI QR Code

Improved Elliptic Scalar Multiplication Algorithms Secure Against Side-Channel Attacks

부가채널 공격에 안전한 효율적인 타원곡선 상수배 알고리즘

  • 임채훈 (세종대학교 인터넷학과)
  • Published : 2002.08.01

Abstract

Improved algorithms for elliptic scalar multiplication secure against side-channel attacks, such as timing and power analysis, are presented and analyzed. We first point out some potential security flaws often overlooked in most previous algorithms and then present a simple $\pm$1-signed encoding scheme that can be used to enhance the security and performance of existing algorithms. More specifically, we propose concrete signed binary and window algorithms based on the proposed $\pm$ 1-signed encoding and analyze their security and performance. The proposed algorithms are shown to be more robust and efficient than previous algorithms.

실행시간이나 전력 소모량 분석 등과 같은 부가채널 공격에 안전하면서도 보다 효율적인 새로운 타원곡선 상수배 알고리즘을 제안한다. 먼저 기존 방식들을 분석하여 잠재적인 문제점들을 지적하고, 이런 문제점들을 제거할 수 있는 간단한 $\pm$1-이진 부호화 방식을 제안한다. 또한 제안 부호화 방식을 이용한 이진 및 고정 윈도우 알고리즘을 기술하고 안전성과 효율성을 분석한다.

Keywords

References

  1. LNCS v.1109 Timing attacks on implementations of Diffie-Hellman,RSA,DSS and other systems C.Kocher
  2. LNCS v.1666 Differential power analysis C.Kocher
  3. LNCS v.1717 Resistance against differential power analysis for elliptic curve crypto-systems J.Coron
  4. LNCS v.2274 A fast parallel elliptic curve multiplication against side channel attacks T.Izu;T.Takagi
  5. LNCS v.2271 Power analysis breaks elliptic curve cryptosystems even secure againgst the timing attacks K.Okeya;K.Sakurai
  6. LNCS v.2271 Protections against differential analysis for elliptic curve cryptography - An algebraic approach M.Joye;C.Tymen
  7. LNCS v.2271 Mist-Am efficient,randomized exponentiation algorithm for resisting power analysis C.D.Walter
  8. LNCS v.2271 Randomized addition-subtraction chains as a counter-measure against power attacks E.Oswald;M.Aigner
  9. P1363: Standard specifications for public key cryptograpgy IEEE
  10. LNCS v.1556 Improved algorithms for elliptic curve arithmetic in GF(2 m) J.Lopez;R.Dahab
  11. LNCS v.1717 Fast multiplication on elliptic curves over GF(2 m) without precomputation J.Lopez;R.Dahab
  12. LNCS v.1751 Fast implementation of elliptic curve arithmetic in GF(p n) C.H.Lim;H.S.Hwang
  13. A course in computational number theory , GTM 138(3rd edition) H.Cohen
  14. LNCS v.2271 Sliding windows succumbs to big mac attack C.D.Walter