Implementing the Tate Pairing
نویسندگان
چکیده
The Weil and Tate pairings have found several new applications in cryptography. To eÆciently implement these cryptosystems it is necessary to optimise the computation time for the Tate pairing. This paper provides methods to achieve fast computation of the Tate pairing. We also give division-free formulae for point tripling on a family of elliptic curves in characteristic three. Examples of the running time for these methods are given.
منابع مشابه
Implementing Pairing-Based Cryptosystems
Pairing-based cryptosystems have been developing very fast in the last few years. As the key primitive, pairing is also the heaviest operation in these systems. The performance of pairing affects the application of the schemes in practice. In this report, we summarise the formulas of the Tate pairing operation on elliptic curves in different coordinate systems and describe a few observations of...
متن کاملTate Pairing Implementation for Hyperelliptic Curves y2 = xp-x + d
The Weil and Tate pairings have been used recently to build new schemes in cryptography. It is known that the Weil pairing takes longer than twice the running time of the Tate pairing. Hence it is necessary to develop more efficient implementations of the Tate pairing for the practical application of pairing based cryptosystems. In 2002, Barreto et al. and Galbraith et al. provided new algorith...
متن کاملImplementation of Tate Pairing on Hyperelliptic Curves of Genus 2
Since Tate pairing was suggested to construct a cryptosystem, fast computation of Tate pairing has been researched recently. Barreto et. al[3] and Galbraith[8] provided efficient algorithms for Tate pairing on y = x − x + b in characteristic 3 and Duursma and Lee[6] gave a closed formula for Tate pairing on y = x − x + d in characteristic p. In this paper, we present completely general and expl...
متن کاملA Remark on Implementing the Weil Pairing
We propose an improved implementation of modified Weil pairings. By reduction of operations in the extension field to those in the base field, we can save some operations in the extension field when computing a modified Weil pairing. In particular, computing e`(P, φ(P )) is the same as computing the Tate pairing without the final powering. So we can save about 50% of time for computing e`(P, φ(...
متن کاملImplementing Cryptographic Pairings on Smartcards
Pairings on elliptic curves are fast coming of age as cryptographic primitives for deployment in new security applications, particularly in the context of implementations of Identity-Based Encryption (IBE). In this paper we describe the implementation of various pairings on a contemporary 32-bit smart-card, the Philips HiPerSmart, an instantiation of the MIPS-32 based SmartMIPS architecture. Th...
متن کامل