Tate Pairing Computation on Jacobi's Elliptic Curves - Université de Rennes Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Tate Pairing Computation on Jacobi's Elliptic Curves

Résumé

We propose for the first time the computation of the Tate pairing on Jacobi intersection curves. For this, we use the geometric interpretation of the group law and the quadratic twist of Jacobi intersection curves to obtain a doubling step formula which is efficient but not competitive compared to the case of Weierstrass curves, Edwards curves and Jacobi quartic curves. As a second contribution, we improve the doubling and addition steps in Miller's algorithm to compute the Tate pairing on the special Jacobi quartic elliptic curve $Y^2 = dX^4 + Z^4$. We use the birational equivalence between Jacobi quartic curves and Weierstrass curves together with a specific point representation to obtain the best result to date among all the curves with quartic twists. In particular for the doubling step in Miller's algorithm, we obtain a theoretical gain between 6% and 21%, depending on the embedding degree and the extension field arithmetic, with respect to Weierstrass curves [6] and Jacobi quartic curves [23].

Dates et versions

hal-00832363 , version 1 (10-06-2013)

Identifiants

Citer

Sylvain Duquesne, Emmanuel Fouotsa. Tate Pairing Computation on Jacobi's Elliptic Curves. Pairing-Based Cryptography-Pairing 2012, May 2012, Cologne, Germany. pp.254-269, ⟨10.1007/978-3-642-36334-4_17⟩. ⟨hal-00832363⟩
163 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More