Paper 2003/086 Original: eprint.iacr.org/2003/086 ↗
On the Selection of Pairing-Friendly Groups
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- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2003-07-17: last updated
- 2003-05-02: published
- Short URL
- https://ia.cr/2003/086
- License
- https://creativecommons.org/licenses/by/4.0/
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}
}