, Volume 17, Issue 4, pp 321-334
Date: 03 Sep 2004

Efficient Implementation of Pairing-Based Cryptosystems

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


Pairing-based cryptosystems rely on the existence of bilinear, nondegenerate, efficiently computable maps (called pairings) over certain groups. Currently, all such pairings used in practice are related to the Tate pairing on elliptic curve groups whose embedding degree is large enough to maintain a good security level, but small enough for arithmetic operations to be feasible. In this paper we describe how to construct ordinary (non-supersingular) elliptic curves containing groups with arbitrary embedding degree, and show how to compute the Tate pairing on these groups efficiently.