In this article we propose a study of the modified Tate pairing in characteristics two and
three. Starting from the η T pairing introduced by Barreto et al.[1], we detail various …

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 …

Identity based cryptography offers a number of functional advantages over traditional public
key cryptosystems and has attracted much research interest in the last few years. The …

Many novel and interesting cryptographic protocols have recently been designed with
bilinear pairings comprising their main calculation. The ηT method for pairing calculation is …

抄録 This paper presents new algorithms for the Tate pairing on a prime field. Recently,
many pairing-based cryptographic schemes have been proposed. However, computing …

The calculation of pairing plays a key role in pairing-based cryptography. Usually, the
calculation is based on Miller's algorithm. However, most of the optimisations of Miller's …

Although identity-based cryptography offers a number of functional advantages over
conventional public key methods, the computational costs are significantly greater. The …

We describe, in detail sufficient for easy implementation, a fast method for calculation of the
Tate pairing, as required for pairing-based cryptographic protocols. We point out various …

Identity-based cryptography uses pairing functions, which are sophisticated bilinear maps
defined on elliptic curves. Computing pairings efficiently in software is presently a relevant …

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 …