정보보호학회논문지 (Journal of the Korea Institute of Information Security & Cryptology)

  • 제16권6호
  • /
  • Pages.95-109
  • /
  • 2006
  • /
  • 1598-3986(pISSN)
  • /
  • 2288-2715(eISSN)
한국정보보호학회 (Korea Institute of Information Security and Cryptology)
권호 표지
DOI QR코드

DOI QR Code

자원이 제약된 장치에서 효율적인 타원곡선 다중 상수배의 구현을 위한 유연한 접근

A Flexible Approach for Efficient Elliptic Curve Multi-Scalar Multiplication on Resource-constrained Devices

  • 서석충 (광주과학기술원 정보통신공학과) ;
  • 김형찬 (광주과학기술원 정보통신공학과) ;
  • 라마크리시나 (광주과학기술원 정보통신공학과)
  • Seo, Seog-Chung (Gwangju Institute of Science and Technology Department of information and Communications) ;
  • Kim, Hyung-Chan (Gwangju Institute of Science and Technology Department of information and Communications) ;
  • Ramakrishna, R.S. (Gwangju Institute of Science and Technology Department of information and Communications)
  • 발행 : 2006.12.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

타원곡선 암호시스템은 작은 키 길이로 인하여 스마트카드, 센서 모트와 같은 메모리, 계산 능력이 제약된 장치에서 사용하기에 적합하다. 본 논문에서는 이러한 장치에서 타원곡선 서명 알고리즘 검증 (uP+vQ, u, v: 상수, P, Q: 타원곡선 위의 점)의 주된 계산인 다중 상수배를 효율적으로 계산하기 위한 알고리즘을 제안한다. 제안 알고리즘은 부분 윈도우와 Interleave 방법에 기반을 둔 것으로서 어떠한 크기의 사전계산 테이블이라도 이용할 수 있을 뿐만 아니라, 해당 테이블에서 최적의 nonzero 밀도를 제공한다. 또한 상수 리코딩이 테이블 조회를 사용하지 않고 상수배 계산과 함께 진행되기 때문에 기존의 다른 알고리즘에 비하여 더욱 메모리를 절약할 수 있다. 실험을 통하여 163비트의 u, v와, 233 비트의 u, v에 대하여 uP+vQ를 수행하는 데 필요한 계산량을 사전계산 테이블의 크기에 따라 비교함으로써 최적의 테이블 크기는 각각 7, 15임을 알아낼 수 있었다.

Elliptic Curve Cryptosystem (ECC) is suitable for resource-constrained devices such as smartcards, and sensor motes because of its short key size. This paper presents an efficient multi-scalar multiplication algorithm which is the main component of the verification procedure in Elliptic Curve Digital Signature Algorithm (ECDSA). The proposed algorithm can make use of a precomputed table of variable size and provides an optimal efficiency for that precomputed table. Furthermore, the given scalar is receded on-the-fly so that it can be merged with the main multiplication procedure. This can achieve more savings on memory than other receding algorithms. Through experiments, we have found that the optimal sizes of precomputed tables are 7 and 15 when uP+vQ is computed for u, v of 163 bits and 233 bits integers. This is shown by comparing the computation time taken by the proposed algorithm and other existing algorithms.

키워드

참고문헌

  1. V.S. Miller, 'Use of Elliptic Curves in Cryptography,' CRYPTO'85, LNCS 218, pp. 417-426, 1986
  2. K. Okeya, and et al, 'Signed Binary Representation Revisited,' CRYPTO 2004, LNCS 3152, pp. 123-139, 2004
  3. B. Möller, 'Fractional Windows Revisited: Improved Signed-Digit Representation for Efficient Exponentiation,' ICISC 2004, LNCS 3506, pp. 137-153, 2004
  4. E. Dahmen, and et al, 'An Advanced Method for Joint Scalar Multiplications on Memory Constraint Devices,' ESAS 2005, LNCS 3813, pp. 189-204, 2005
  5. J. Solinas, 'Efficient Arithmetic on Koblitz Curves,' Design, Codes and Cryptography, 19:195-249, 2000 https://doi.org/10.1023/A:1008306223194
  6. K. Schmidt-Samoa, and et al. 'Analysis of Fractional Window Recoding Methods and Their Application to Elliptic Curve Cryptosystems,' IEEE Transaction on computers, Vol. 55, 2006
  7. Y. Sakai and K. Sakurai, 'Algorithms for Efficient Simultaneous Elliptic Scalar Multiplication,' ISC 2002, LNCS 2433, pp. 484-499, 2002
  8. J. Solinas, 'Low-Weight Binary Representations for Pairs of Integers,' CACR Technical Reports, CORR 2001-41 University of Waterloo, 2001
  9. B. Kuang, Y. Zhu, and Y. Zhang, 'An Improved Algorithm for uP + vQ Using JSF3,' ACNS 2005, LNCS 3089, pp. 467-478, 2004
  10. B. Möller, 'Algorithms for Multiexponentiation,' SAC 2001, LNCS 2259, pp. 165-180, 2001
  11. B. Moller, 'mproved Techniques for Fast Exponentiation,' ICISC 2002, LNCS 2587, pp. 298-312, 2003
  12. X. Ruan and R.S. Katti, 'Left-to- Right Optimal Signed-Binary Representation of a Pair of Integers,' IEEE Transaction on Computers, Vol. 54, 2005
  13. H. Cohen, A. Miyaji, and T. Ono, 'Efficient Elliptic Curve Exponentiation Using Mixed Coordinates,' ASIACRYPT'98, LNCS 1514, pp. 51-65, 1998
  14. K. Okeya and K. Sakurai, 'Fast Multi-scalar Multiplication Methods on Elliptic Curves with Precomputation Strategy Using Montgomery Trick,' CHES 2002, LNCS 2523, pp. 564-578, 2003
  15. IEEE P1363: Standard Specifications for Public Key Cryptography (Draft 13) Annex A, 1999
  16. E. De Win, et al, 'On the Performance of Signature Schemes Based on Elliptic Curves,' ANTS, pp.252-266, 1998 https://doi.org/10.1007/BFb0054867
  17. SEC 2-Recommended Elliptic Curve Domain Parameters. Standards for Efficient Cryptography. 1999