Implementing the Tate Pairing

  • Authors:
  • Steven D. Galbraith;Keith Harrison;David Soldera

  • Affiliations:
  • -;-;-

  • Venue:
  • ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
  • Year:
  • 2002

Quantified Score

Hi-index 0.13

Visualization

Abstract

The Tate pairing has found several new applications in cryptography. This paper provides methods to quickly compute the Tate pairing, and hence enables efficient implementation of these cryptosystems. We also give division-free formulae for point tripling on a family of elliptic curves in characteristic three. Examples of the running time for these methods are given.