Cryptology ePrint Archive: Report 2007/463

Efficient GF(3m) Multiplication Algorithm for eta T Pairing

Gen Takahashi and Fumitaka Hoshino and Tetsutaro Kobayashi

Abstract: The computation speed of pairing based cryptosystems is slow compared with the other public key cryptosystems even though several efficient computation algorithms have been proposed. Thus more efficient computation of the Tate pairing is an important research goal. GF(3m) multiplication in GF(36m) in the pairing algorithm is the greatest consumer of time. Past research concentrated on reducing the number of GF(3m) multiplications, for instance the Karatsuba method. In this article, we propose a new method to reduce the number of online precomputations( precomputations) in GF(3m) multiplications for the eta T pairing. The proposed algorithm reduces 18 online precomputations in GF(36m) in the eta T pairing to 4 online precomputations by reusing the intermediate products obtained in precomputation.We implement the proposed algorithm and compare the time taken by the proposed algorithm with that of the previous work. Our algorithm offers a 40% performance increase for GF(3m) multiplications in GF(36m) on an AMD 64-bit processor. Additionally, a completely new finding is obtained. The results show that the reducing the number of the multiplications in GF(36m) does not necessarily lead to a speed-up of the eta T pairing calculation.

Category / Keywords: public-key cryptography / elliptic curve cryptosystem

Date: received 10 Dec 2007, last revised 6 Feb 2008

Contact author: takahashi gen at lab ntt co jp

Available format(s): PDF | BibTeX Citation

Version: 20080207:063203 (All versions of this report)

Short URL: ia.cr/2007/463

Discussion forum: Show discussion | Start new discussion