On the Selection of Pairing-Friendly Groups

Paulo S.  L.  M.  Barreto; Ben Lynn; Michael Scott

Paper 2003/086

On the Selection of Pairing-Friendly Groups

Paulo S. L. M. Barreto, Ben Lynn, and Michael Scott

Abstract

We propose a simple algorithm to select group generators suitable for pairing-based cryptosystems. The selected parameters are shown to favor implementations of the Tate pairing that are at once conceptually simple and efficient, with an observed performance about 2 to 10 times better than previously reported implementations, depending on the embedding degree. Our algorithm has beneficial side effects: various non-pairing operations become faster, and bandwidth may be saved.

Metadata

Available format(s): PDF PS
Category: Public-key cryptography
Publication info: Published elsewhere. Accepted for SAC'2003
Keywords: pairing-based cryptosystems group generators elliptic curves Tate pairing
Contact author(s): pbarreto @ larc usp br
History: 2003-07-17: last of 3 revisions; 2003-05-02: received; See all versions
Short URL: https://ia.cr/2003/086
License: CC BY

BibTeX

@misc{cryptoeprint:2003/086,
      author = {Paulo S.  L.  M.  Barreto and Ben Lynn and Michael Scott},
      title = {On the Selection of Pairing-Friendly Groups},
      howpublished = {Cryptology {ePrint} Archive, Paper 2003/086},
      year = {2003},
      url = {https://eprint.iacr.org/2003/086}
}