Efficient computation of eta pairing over binary field with vandermonde matrix

Masaaki Shirase, Tsuyoshi Takagi, Dooho Choi, Dong Guk Han, Howon Kim

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


This paper provides an efficient algorithm for computing the ηTpairing on supersingular elliptic curves over fields of characteristic two. In the proposed algorithm, we deploy ploy a modified multiplication in F2 4nusing the Vandermonde matrix. For F, G;2 4nthe proposed multiplication method computes B . F .G instead ofF G . with some β.F.G because β is eliminated by the final exponentiation of the pairing computation. The proposed multiplication method asymptotically requires only 7 multiplications in 2n F as n 8 , while the cost of the previously fastest Karatsuba method is 9 multiplications in 2n F . Consequently, the cost of the T pairing computation is reduced by 14.3%.

Original languageEnglish
Pages (from-to)129-139
Number of pages11
JournalETRI Journal
Issue number2
Publication statusPublished - Apr 1 2009
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Electronic, Optical and Magnetic Materials
  • Computer Science(all)
  • Electrical and Electronic Engineering


Dive into the research topics of 'Efficient computation of eta pairing over binary field with vandermonde matrix'. Together they form a unique fingerprint.

Cite this