Efficient Algorithms for Tate Pairing

Tetsutaro KOBAYASHI; Kazumaro AOKI; Hideki IMAI

doi:10.1093/ietfec/e89-a.1.134

Efficient Algorithms for Tate Pairing

Tetsutaro KOBAYASHI, Kazumaro AOKI, Hideki IMAI

Full Text Views

0

Share
Cite this

Summary :

This paper presents new algorithms for the Tate pairing on a prime field. Recently, many pairing-based cryptographic schemes have been proposed. However, computing pairings incurs a high computational cost and represents the bottleneck to using pairings in actual protocols. This paper shows that the proposed algorithms reduce the cost of multiplication and inversion on an extension field, and reduce the number of calculations of the extended finite field. This paper also discusses the optimal algorithm to be used for each pairing parameter and shows that the total computational cost is reduced by 50% if k = 6 and 57% if k = 8.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E89-A No.1 pp.134-143

Publication Date: 2006/01/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1093/ietfec/e89-a.1.134

Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security)

Category: Elliptic Curve Cryptography

Cite this

Copy

Tetsutaro KOBAYASHI, Kazumaro AOKI, Hideki IMAI, "Efficient Algorithms for Tate Pairing" in IEICE TRANSACTIONS on Fundamentals, vol. E89-A, no. 1, pp. 134-143, January 2006, doi: 10.1093/ietfec/e89-a.1.134.
Abstract: This paper presents new algorithms for the Tate pairing on a prime field. Recently, many pairing-based cryptographic schemes have been proposed. However, computing pairings incurs a high computational cost and represents the bottleneck to using pairings in actual protocols. This paper shows that the proposed algorithms reduce the cost of multiplication and inversion on an extension field, and reduce the number of calculations of the extended finite field. This paper also discusses the optimal algorithm to be used for each pairing parameter and shows that the total computational cost is reduced by 50% if k = 6 and 57% if k = 8.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e89-a.1.134/_p

Copy

@ARTICLE{e89-a_1_134,
author={Tetsutaro KOBAYASHI, Kazumaro AOKI, Hideki IMAI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Efficient Algorithms for Tate Pairing},
year={2006},
volume={E89-A},
number={1},
pages={134-143},
abstract={This paper presents new algorithms for the Tate pairing on a prime field. Recently, many pairing-based cryptographic schemes have been proposed. However, computing pairings incurs a high computational cost and represents the bottleneck to using pairings in actual protocols. This paper shows that the proposed algorithms reduce the cost of multiplication and inversion on an extension field, and reduce the number of calculations of the extended finite field. This paper also discusses the optimal algorithm to be used for each pairing parameter and shows that the total computational cost is reduced by 50% if k = 6 and 57% if k = 8.},
keywords={},
doi={10.1093/ietfec/e89-a.1.134},
ISSN={1745-1337},
month={January},}

Copy

TY - JOUR
TI - Efficient Algorithms for Tate Pairing
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 134
EP - 143
AU - Tetsutaro KOBAYASHI
AU - Kazumaro AOKI
AU - Hideki IMAI
PY - 2006
DO - 10.1093/ietfec/e89-a.1.134
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E89-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2006
AB - This paper presents new algorithms for the Tate pairing on a prime field. Recently, many pairing-based cryptographic schemes have been proposed. However, computing pairings incurs a high computational cost and represents the bottleneck to using pairings in actual protocols. This paper shows that the proposed algorithms reduce the cost of multiplication and inversion on an extension field, and reduce the number of calculations of the extended finite field. This paper also discusses the optimal algorithm to be used for each pairing parameter and shows that the total computational cost is reduced by 50% if k = 6 and 57% if k = 8.
ER -