CryptoDB
On the Selection of Pairing-Friendly Groups
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2003-11802, title={On the Selection of Pairing-Friendly Groups}, booktitle={IACR Eprint archive}, keywords={public-key cryptography / pairing-based cryptosystems, group generators, elliptic curves, Tate pairing}, url={http://eprint.iacr.org/2003/086}, note={Accepted for SAC'2003 pbarreto@larc.usp.br 12250 received 1 May 2003, last revised 16 Jul 2003}, author={Paulo S. L. M. Barreto and Ben Lynn and Michael Scott}, year=2003 }