IEICE TRANSACTIONS on Fundamentals
Powered Tate Pairing Computation
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E91-A No.1 pp.338-341
- Publication Date
- 2008/01/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1093/ietfec/e91-a.1.338
- Type of Manuscript
- Special Section LETTER (Special Section on Cryptography and Information Security)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Bo Gyeong KANG, Je Hong PARK, "Powered Tate Pairing Computation" in IEICE TRANSACTIONS on Fundamentals,
vol. E91-A, no. 1, pp. 338-341, January 2008, doi: 10.1093/ietfec/e91-a.1.338.
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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e91-a.1.338/_p
Copy
@ARTICLE{e91-a_1_338,
author={Bo Gyeong KANG, Je Hong PARK, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Powered Tate Pairing Computation},
year={2008},
volume={E91-A},
number={1},
pages={338-341},
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.},
keywords={},
doi={10.1093/ietfec/e91-a.1.338},
ISSN={1745-1337},
month={January},}
Copy
TY - JOUR
TI - Powered Tate Pairing Computation
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 338
EP - 341
AU - Bo Gyeong KANG
AU - Je Hong PARK
PY - 2008
DO - 10.1093/ietfec/e91-a.1.338
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E91-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2008
AB - 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.
ER -
English
