Word Level Multiplier for GF(2m) Using Gaussian Normal Basis 


Vol. 31,  No. 11, pp. 1120-1127, Nov.  2006


PDF Full-Text
  Abstract

This paper presents a new word level multiplier over GF(2m) for elliptic curve cryptosystem. The proposed multiplier uses Gaussian normal basis representation and produces multiplication results at a rate of one per ??m/w??clock cycles, where w is the selected word size. We implement the proposed design using Xilinx XC2V1000 FPGA device. Our design has significantly less critical path delay compared with previously proposed hardware implementations.

  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]

C. H. Kim, Y. K. Kwon, T. H. Kim, S. Kwon, C. P. Hong, "Word Level Multiplier for GF(2m) Using Gaussian Normal Basis," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 11, pp. 1120-1127, 2006. DOI: .

[ACM Style]

Chang Hoon Kim, Yun Ki Kwon, Tae Ho Kim, Soonhak Kwon, and Chun Pyo Hong. 2006. Word Level Multiplier for GF(2m) Using Gaussian Normal Basis. The Journal of Korean Institute of Communications and Information Sciences, 31, 11, (2006), 1120-1127. DOI: .

[KICS Style]

Chang Hoon Kim, Yun Ki Kwon, Tae Ho Kim, Soonhak Kwon, Chun Pyo Hong, "Word Level Multiplier for GF(2m) Using Gaussian Normal Basis," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 11, pp. 1120-1127, 11. 2006.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880