On the Selection of Pairing-Friendly Groups

  • Paulo S. L. M. Barreto
  • Ben Lynn
  • Michael Scott
Conference paper

DOI: 10.1007/978-3-540-24654-1_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3006)
Cite this paper as:
Barreto P.S.L.M., Lynn B., Scott M. (2004) On the Selection of Pairing-Friendly Groups. In: Matsui M., Zuccherato R.J. (eds) Selected Areas in Cryptography. SAC 2003. Lecture Notes in Computer Science, vol 3006. Springer, Berlin, Heidelberg

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.

Keywords

pairing-based cryptosystems group generators elliptic curves Tate pairing 
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Paulo S. L. M. Barreto
    • 1
  • Ben Lynn
    • 2
  • Michael Scott
    • 3
  1. 1.Escola PolitécnicaUniversidade de São PauloSão PauloBrazil
  2. 2.Computer Science DepartmentStanford UniversityUSA
  3. 3.School of Computer ApplicationsDublin City University BallymunDublin 9Ireland

Personalised recommendations