English

Faster computation of the Tate pairing

Number Theory 2010-05-28 v3 Algebraic Geometry

Abstract

This paper proposes new explicit formulas for the doubling and addition step in Miller's algorithm to compute the Tate pairing. For Edwards curves the formulas come from a new way of seeing the arithmetic. We state the first geometric interpretation of the group law on Edwards curves by presenting the functions which arise in the addition and doubling. Computing the coefficients of the functions and the sum or double of the points is faster than with all previously proposed formulas for pairings on Edwards curves. They are even competitive with all published formulas for pairing computation on Weierstrass curves. We also speed up pairing computation on Weierstrass curves in Jacobian coordinates. Finally, we present several examples of pairing-friendly Edwards curves.

Keywords

Cite

@article{arxiv.0904.0854,
  title  = {Faster computation of the Tate pairing},
  author = {Christophe Arene and Tanja Lange and Michael Naehrig and Christophe Ritzenthaler},
  journal= {arXiv preprint arXiv:0904.0854},
  year   = {2010}
}

Comments

15 pages, 2 figures. Final version accepted for publication in Journal of Number Theory

R2 v1 2026-06-21T12:48:28.504Z