On the Selection of Pairing-Friendly Groups

Full textClick to download.
CitationSelected Areas in Cryptography-SAC, 2003
AuthorsPaulo S.L.M. Barreto
Ben Lynn
Michael Scott


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.

Back to publications
Back to previous page