This paper considers the computation of the Ate pairing on the Hessian model of elliptic curves. Due to the many important properties making the model attractive in cryptography, we compute for the first time the Ate pairing on this model and show how both the Tate and the Ate pairings can be parallelized on this curve. We wrote codes in the Sage software to ensure the correctness of formulas in this work. Keywords: Hessian curves, Tate and ate pairings, Parallel computatio
International audienceText. This paper proposes new explicit formulas for the doubling and addition ...
AbstractTextThis paper proposes new explicit formulas for the doubling and addition steps in Miller'...
Analyse, arithmétique et géométrie Pairings were first studied as potential attacks on elliptic curv...
In recent papers [4], [9] they worked on hyperelliptic curves H b defined by y +y = x +x +b o...
Abstract. The Weil and Tate pairings have been used recently to build new schemes in cryptography. I...
In this paper we show that the Ate pairing, originally defined for elliptic curves, generalises to h...
The Weil and Tate pairings have found several new applications in cryptography. To efficiently imple...
In this paper, a method for the efficient computation of Tate pairings on curves whichis a generaliz...
The Tate pairing has plenty of attractive applications, e.g., ID-based cryptosystems, short signatur...
A self-pairing is a pairing computation where both inputs are the same group element. Self-pairings ...
Pairings on elliptic curves recently obtained a lot of attention not only as a means to attack curve...
We derive a new algorithm for computing the Tate pairing on an elliptic curve over a finite field. ...
International audienceThis paper proposes the computation of the Tate pairing, Ate pairing and its v...
Chapter 23 showed us how to build DL systems on the Jacobian of curves. In Chapter 1 we introduced D...
Various elliptic curve models reveal different efficiency of pairing computation. This paper propose...
International audienceText. This paper proposes new explicit formulas for the doubling and addition ...
AbstractTextThis paper proposes new explicit formulas for the doubling and addition steps in Miller'...
Analyse, arithmétique et géométrie Pairings were first studied as potential attacks on elliptic curv...
In recent papers [4], [9] they worked on hyperelliptic curves H b defined by y +y = x +x +b o...
Abstract. The Weil and Tate pairings have been used recently to build new schemes in cryptography. I...
In this paper we show that the Ate pairing, originally defined for elliptic curves, generalises to h...
The Weil and Tate pairings have found several new applications in cryptography. To efficiently imple...
In this paper, a method for the efficient computation of Tate pairings on curves whichis a generaliz...
The Tate pairing has plenty of attractive applications, e.g., ID-based cryptosystems, short signatur...
A self-pairing is a pairing computation where both inputs are the same group element. Self-pairings ...
Pairings on elliptic curves recently obtained a lot of attention not only as a means to attack curve...
We derive a new algorithm for computing the Tate pairing on an elliptic curve over a finite field. ...
International audienceThis paper proposes the computation of the Tate pairing, Ate pairing and its v...
Chapter 23 showed us how to build DL systems on the Jacobian of curves. In Chapter 1 we introduced D...
Various elliptic curve models reveal different efficiency of pairing computation. This paper propose...
International audienceText. This paper proposes new explicit formulas for the doubling and addition ...
AbstractTextThis paper proposes new explicit formulas for the doubling and addition steps in Miller'...
Analyse, arithmétique et géométrie Pairings were first studied as potential attacks on elliptic curv...