Faster computation of the Tate pairing - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Number Theory Année : 2011

Faster computation of the Tate pairing

Résumé

Text. This paper proposes new explicit formulas for the doubling and addition steps in Miller's algorithm to compute the Tate pairing on elliptic curves in Weierstrass and in Edwards form. 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 addition and doubling. The Tate pairing on Edwards curves can be computed by using these functions in Miller's algorithm. Computing the sum of two points or the double of a point and the coefficients of the corresponding functions is faster with our formulas 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 improve the formulas for Tate pairing computation on Weierstrass curves in Jacobian coordinates. Finally, we present several examples of pairing-friendly Edwards curves.

Dates et versions

hal-01099947 , version 1 (05-01-2015)

Identifiants

Citer

Christophe Ritzenthaler, Christophe Arene, Tanja Lange, Michael Naehrig. Faster computation of the Tate pairing. Journal of Number Theory, 2011, 131 (5), pp.842-857. ⟨10.1016/j.jnt.2010.05.013⟩. ⟨hal-01099947⟩
197 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More