Powered Tate Pairing Computation

Bo Gyeong KANG  Je Hong PARK  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E91-A   No.1   pp.338-341
Publication Date: 2008/01/01
Online ISSN: 1745-1337
DOI: 10.1093/ietfec/e91-a.1.338
Print ISSN: 0916-8508
Type of Manuscript: Special Section LETTER (Special Section on Cryptography and Information Security)
powered Tate pairing,  Tate pairing,  Eta pairing,  bilinear map,  elliptic curve cryptosystem,  

Full Text: PDF(82.9KB)>>
Buy this Article

In this letter, we provide a simple proof of bilinearity for the eta pairing. Based on it, we show an efficient method to compute the powered Tate pairing as well. Although efficiency of our method is equivalent to that of the Tate pairing on the eta pairing approach, but ours is more general in principle.