2007
DOI: 10.1007/978-3-540-72540-4_25
|View full text |Cite
|
Sign up to set email alerts
|

Ate Pairing on Hyperelliptic Curves

Abstract: Abstract. In this paper we show that the Ate pairing, originally defined for elliptic curves, generalises to hyperelliptic curves and in fact to arbitrary algebraic curves. It has the following surprising properties: The loop length in Miller's algorithm can be up to g times shorter than for the Tate pairing, with g the genus of the curve, and the pairing is automatically reduced, i.e. no final exponentiation is needed.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
53
0

Year Published

2009
2009
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 46 publications
(53 citation statements)
references
References 22 publications
0
53
0
Order By: Relevance
“…However, working directly on the curve has the drawback that twists of curves are not easy to relate explicitly to twists of the Jacobian, hence it is hard to generalize the twisted ate pairing in higher genus [12]. Since our point of view is to consider pairing on abelian varieties, it is easy for us to extend all results of [14] to higher dimension.…”
Section: The Tate Pairingmentioning
confidence: 99%
See 2 more Smart Citations
“…However, working directly on the curve has the drawback that twists of curves are not easy to relate explicitly to twists of the Jacobian, hence it is hard to generalize the twisted ate pairing in higher genus [12]. Since our point of view is to consider pairing on abelian varieties, it is easy for us to extend all results of [14] to higher dimension.…”
Section: The Tate Pairingmentioning
confidence: 99%
“…It is well known (see for instance [12]) that in the case that (0) is in the pole of the function f ,n,P then the Tate pairing can be defined as f ,n,P (Q)/c where c correspond to the leading coefficient of f ,n,P in the completion of Θ n along A . Equation (27) can be seen as a version of this since the leading coefficient of f ,n,P,i is the same as f ,n,P,j and the latter can be obtained as θj ( z P ) θj (0) (up to a th -power) when (0) is not in the pole of Θ n,j .…”
Section: Computing the Weil And Tate Pairingsmentioning
confidence: 99%
See 1 more Smart Citation
“…One can show that if the function f n,D1 is properly normalized, we only need to evaluate the rational function f n,D1 at the effective part of the reduced divisor D 2 in order to compute the Tate pairing [3,14].…”
Section: Tate Pairing On Hyperelliptic Curvesmentioning
confidence: 99%
“…considered the Eta pairing computation on general divisors on supersingular genus 3 hyperelliptic curves with the form of y 2 = x 7 − x ± 1. Recently, the Ate pairing, which is an extension of the Eta pairing to the setting of ordinary curves, has been generalized to hyperelliptic curves [14] as well. Although the Eta and Ate pairings hold the record for speed at the present time, we will focus our attention on the Tate pairing in this paper.…”
Section: Introductionmentioning
confidence: 99%