Computing the Tate Pairing

  • Michael Scott
Conference paper

DOI: 10.1007/978-3-540-30574-3_20

Volume 3376 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Scott M. (2005) Computing the Tate Pairing. In: Menezes A. (eds) Topics in Cryptology – CT-RSA 2005. CT-RSA 2005. Lecture Notes in Computer Science, vol 3376. Springer, Berlin, Heidelberg


We describe, in detail sufficient for easy implementation, a fast method for calculation of the Tate pairing, as required for pairing-based cryptographic protocols. We point out various optimisations and tricks, and compare timings of a pairing-based Identity Based Encryption scheme with an optimised RSA implementation.


Elliptic curves pairing-based cryptosystems 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Michael Scott
    • 1
  1. 1.School of ComputingDublin City UniversityBallymun, Dublin 9Ireland