Powered Tate Pairing Computation

Bo Gyeong KANG; Je Hong PARK

doi:10.1093/ietfec/e91-a.1.338

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Online ISSN : 1745-1337
Print ISSN : 0916-8508

Special Section on Cryptography and Information Security

Powered Tate Pairing Computation

Bo Gyeong KANG, Je Hong PARK

Author information

Keywords: powered Tate pairing, Tate pairing, Eta pairing, bilinear map, elliptic curve cryptosystem

JOURNAL RESTRICTED ACCESS

2008 Volume E91.A Issue 1 Pages 338-341

DOI https://doi.org/10.1093/ietfec/e91-a.1.338

Details

Abstract

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.

Content from these authors

Favorites & Alerts

Corresponding author

Register with J-STAGE for free!