On the Computational Cost of Pairing and ECC Scalar Multiplication 


Vol. 36,  No. 1, pp. 14-21, Jan.  2011


PDF
  Abstract

Cryptographic protocols based on bilinear pairings provide excellent alternatives to conventional elliptic curve cryptosystems based on discrete logarithm problems. Through active research has been done toward fast computation of the bilinear pairings, it is still believed that the computational cost of one pairing computation is heavier than the cost of one ECC scalar multiplication. However, there have been many progresses in pairing computations over binary fields. In this paper, we compare the cost of BLS signature scheme with ECDSA with equvalent level of security parameters. Analysis shows that the cost of the pairing computation is quite comparable to the cost of ECC scalar multiplication for the case of binary fields.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

N. Koo, G. H. Jo, C. H. Kim, S. Kwon, "On the Computational Cost of Pairing and ECC Scalar Multiplication," The Journal of Korean Institute of Communications and Information Sciences, vol. 36, no. 1, pp. 14-21, 2011. DOI: .

[ACM Style]

Namhun Koo, Gook Hwa Jo, Chang Hoon Kim, and Soonhak Kwon. 2011. On the Computational Cost of Pairing and ECC Scalar Multiplication. The Journal of Korean Institute of Communications and Information Sciences, 36, 1, (2011), 14-21. DOI: .

[KICS Style]

Namhun Koo, Gook Hwa Jo, Chang Hoon Kim, Soonhak Kwon, "On the Computational Cost of Pairing and ECC Scalar Multiplication," The Journal of Korean Institute of Communications and Information Sciences, vol. 36, no. 1, pp. 14-21, 1. 2011.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880