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. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Barreto, P. S. L. M., Lynn, B., & Scott, M. (2004). On the selection of pairing-friendly groups. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3006, 17–25. https://doi.org/10.1007/978-3-540-24654-1_2
Mendeley helps you to discover research relevant for your work.