Browse > Article
http://dx.doi.org/10.13089/JKIISC.2004.14.4.135

On the Security of ID-Based Cryptosystem against Power Analysis Attacks  

양연형 (포항공과대학교)
박동진 (포항공과대학)
이필중 (포항공과대학교/KT 기술연구소)
Abstract
The ID-based cryptosystem and Power Analysis Attack are attracting many researchers and have been developed aggressively to date. Especially, DPA (Differential Power Analysis) attack has been considered to be the most powerful attack against low power devices, such as smart cards. However, these two leading topics are researched independently and have little hewn relations with each other. In this paper, we investigate the effect of power analysis attack against ID based cryptosystem. As a result, we insist that ID-based cryptosystem is secure against DPA and we only need to defend against SPA (Simple Power Analysis).
Keywords
ID-based cryptosystem; bilinear pairing; power analysis; DPA; SPA;
Citations & Related Records
연도 인용수 순위
  • Reference
1 J. Cha and J. Cheon, 'An Identity -Based Signature from Gap DiffieHellman Groups,' PKC 2003, LNCS 2567, pp. 18-30
2 G. Frey and H.-G. R$\ddot{u}$ck, 'A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves,' Math. Comp., vol. 62, no. 206 (1994), pp. 865-874   DOI   ScienceOn
3 D. Boneh and M. Franklin, 'Identity -Based Encryption from the Weil Pairing,' Crypto 2001. LNCS 2139, pp. 213-229
4 A. J. Menezes, T. Okamoto, and S. A. Vanstone, 'Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field,' IEEE Trans. Information Theory, vol. 39, no. 5, pp. 1639-1646   DOI   ScienceOn
5 P. C. Kocher, J. Jaffe, and B. Jun, 'Differential Power Analysis,' Crypto 1999, LNCS 1666, pp. 388-397
6 V, Miller, 'Short Programs for Functions on Curves,' unpublished manuscript, 1986
7 R. L. Rivest, A. Shamir, and L. Adleman, 'A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,' Communications of the ACM, 21(2):120-126, 1978   DOI   ScienceOn
8 T. ElGamal. 'A Public-Key Cryptosystem and a Sinature Scheme Based on Discrete Logarithms,' IEEE Trans. Information Theory, vol. 31. no. 4, pp. 469-472, 1985   DOI