Cryptology ePrint Archive: Report 2003/086

On the Selection of Pairing-Friendly Groups

Paulo S. L. M. Barreto and 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.

Category / Keywords: public-key cryptography / pairing-based cryptosystems, group generators, elliptic curves, Tate pairing

Publication Info: Accepted for SAC'2003

Date: received 1 May 2003, last revised 16 Jul 2003

Contact author: pbarreto at larc usp br

Available formats: Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20030717:021649 (All versions of this report)

Discussion forum: Show discussion | Start new discussion