Efficient GF (3) Multiplication Algorithm for ηT Pairing
نویسندگان
چکیده
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 (3) multiplication in GF (3) in the pairing algorithm is the greatest consumer of time. Past research concentrated on reducing the number of GF (3) multiplications, for instance the Karatsuba method. In this article, we propose a new method to reduce the number of online precomputations(precomputations) in GF (3) multiplications for the ηT pairing. The proposed algorithm reduces 18 online precomputations in GF (3) in the η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 (3) multiplications in GF (3) 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 (3) does not necessarily lead to a speed-up of the ηT pairing calculation.
منابع مشابه
Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397)
There are many useful cryptographic schemes, such as ID-based encryption, short signature, keyword searchable encryption, attribute-based encryption, functional encryption, that use a bilinear pairing. It is important to estimate the security of such pairing-based cryptosystems in cryptography. The most essential number-theoretic problem in pairing-based cryptosystems is the discrete logarithm ...
متن کاملEfficient Implementation of Pairing-Based Cryptography on a Sensor Node
Pairing-based cryptography provides us many novel cryptographic applications such as ID-based cryptosystems and efficient broadcast encryptions. The security problems in ubiquitous sensor networks have been discussed in many papers, and pairing-based cryptography is a crucial technique to solve them. Due to the limited resources in the current sensor node, it is challenged to optimize the imple...
متن کاملKey Length Estimation of Pairing-Based Cryptosystems Using η T Pairing
The security of pairing-based cryptosystems depends on the difficulty of the discrete logarithm problem (DLP) over certain types of finite fields. One of the most efficient algorithms for computing a pairing is the ηT pairing over supersingular curves on finite fields whose characteristic is 3. Indeed many high-speed implementations of this pairing have been reported, and it is an attractive ca...
متن کاملBreaking pairing-based cryptosystems
In this paper, we discuss solving the DLP over GF (36·97) by using the function field sieve (FFS) for breaking paring-based cryptosystems using the ηT pairing over GF (3 ). The extension degree 97 has been intensively used in benchmarking tests for the implementation of the ηT pairing, and the order (923-bit) of GF (3 6·97) is substantially larger than the previous world record (676-bit) of sol...
متن کاملEfficient Implementation of the etaT Pairing on GPU
Recently, efficient implementation of cryptographic algorithms on graphics processing units (GPUs) has attracted a lot of attention in the cryptologic research community. In this paper, we deal with efficient implementation of the ηT pairing on supersingular curves over finite fields of characteristics 3. We report the performance results of implementations on NVIDIA GTX 285, GTX 480, Tesla C10...
متن کامل