Pairing Computation on Hyperelliptic Curves of Genus 2 Colm Ó hÉigeartaigh
ثبت نشده
چکیده
منابع مشابه
Efficient pairing computation on supersingular Abelian varieties
We present a general technique for the efficient computation of pairings on supersingular Abelian varieties. This formulation, which we call the eta pairing, generalises results of Duursma and Lee for computing the Tate pairing on supersingular elliptic curves in characteristic three. We then show how our general technique leads to a new algorithm which is about twice as fast as the Duursma-Lee...
متن کاملTate Pairing Computation on the Divisors of Hyperelliptic Curves of Genus 2
We present an explicit Eta pairing approach for computing the Tate pairing on general divisors of hyperelliptic curves Hd of genus 2, where Hd : y 2 + y = x5 + x3 + d is defined over F2n with d = 0 or 1. We use the resultant for computing the Eta pairing on general divisors. Our method is very general in the sense that it can be used for general divisors, not only for degenerate divisors. In th...
متن کاملEfficient Pairing Computation on Genus 2 Curves in Projective Coordinates
In recent years there has been much interest in the development and the fast computation of bilinear pairings due to their practical and myriad applications in cryptography. Well known efficient examples are the Weil and Tate pairings and their variants such as the Eta and Ate pairings on the Jacobians of (hyper-)elliptic curves. In this paper, we consider the use of projective coordinates for ...
متن کاملFast computation of Tate pairing on general divisors for hyperelliptic curves of genus
For the Tate pairing implementation over hyperelliptic curves, there is a development by DuursmaLee and Barreto et al., and those computations are focused on degenerate divisors. As divisors are not degenerate form in general, it is necessary to find algorithms on general divisors for the Tate pairing computation. In this paper, we present two efficient methods for computing the Tate pairing ov...
متن کاملImplementation of Tate Pairing on Hyperelliptic Curves of Genus 2
Since Tate pairing was suggested to construct a cryptosystem, fast computation of Tate pairing has been researched recently. Barreto et. al[3] and Galbraith[8] provided efficient algorithms for Tate pairing on y = x − x + b in characteristic 3 and Duursma and Lee[6] gave a closed formula for Tate pairing on y = x − x + d in characteristic p. In this paper, we present completely general and expl...
متن کامل