Welcome to the resource topic for 2003/086
Title:
On the Selection of Pairing-Friendly Groups
Authors: Paulo S. L. M. Barreto, Ben Lynn, 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.
ePrint: https://eprint.iacr.org/2003/086
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .