AbstractFor an elliptic curve E over any field K, the Weil pairing en is a bilinear map on n-torsion. In this paper, we consider E over the dual numbers K[ϵ] and define a non-degenerate “Weil pairing on p-torsion” which shares many of the same properties of the Weil pairing. We also show that the discrete logarithm attacks on p-torsion subgroups of Semaev and Rück may be viewed as Weil-pairing-based attacks, just like the MOV attack. Finally, we describe an attack on the discrete logarithm problem on anomalous curves, analogous to that of Smart, using a lift of E over Fp[ϵ]
Abstract. The Weil and Tate pairings are defined for elliptic curves over fields, including finite f...
Analyse, arithmétique et géométrie Pairings were first studied as potential attacks on elliptic curv...
AbstractUsing the Miller algorithm, we can efficiently compute the Weil pairing for two given points...
AbstractFor an elliptic curve E over any field K, the Weil pairing en is a bilinear map on n-torsion...
We give an elementary and self-contained introduction to pairings on elliptic curves over finite fie...
International audienceWe give an elementary and self-contained introduction to pairings on elliptic ...
Elliptic curves have a rich algebraic structure which can, in fact, be used in applications to crypt...
This thesis presents the Weil pairing on elliptic curves as a tool to implement a tripartite Diffie-...
AbstractUsing the Miller algorithm, we can efficiently compute the Weil pairing for two given points...
In this paper we investigate the asymptotic effectiveness of the Gaudry–Hess–Smart Weil descent atta...
The security of many public-key cryptosystems relies on the existence of groups in which the discret...
This paper shows that many of elliptic curve cryptosystems over quartic extension fields of odd char...
SUMMARY This paper shows that many of elliptic curve cryptosystems over quartic extension fields of ...
To help motivate the Weil pairing, we discuss it in the context of elliptic curves over the field of...
In this paper we will prove a basic property of weil pairing which helps in evaluating its value. We...
Abstract. The Weil and Tate pairings are defined for elliptic curves over fields, including finite f...
Analyse, arithmétique et géométrie Pairings were first studied as potential attacks on elliptic curv...
AbstractUsing the Miller algorithm, we can efficiently compute the Weil pairing for two given points...
AbstractFor an elliptic curve E over any field K, the Weil pairing en is a bilinear map on n-torsion...
We give an elementary and self-contained introduction to pairings on elliptic curves over finite fie...
International audienceWe give an elementary and self-contained introduction to pairings on elliptic ...
Elliptic curves have a rich algebraic structure which can, in fact, be used in applications to crypt...
This thesis presents the Weil pairing on elliptic curves as a tool to implement a tripartite Diffie-...
AbstractUsing the Miller algorithm, we can efficiently compute the Weil pairing for two given points...
In this paper we investigate the asymptotic effectiveness of the Gaudry–Hess–Smart Weil descent atta...
The security of many public-key cryptosystems relies on the existence of groups in which the discret...
This paper shows that many of elliptic curve cryptosystems over quartic extension fields of odd char...
SUMMARY This paper shows that many of elliptic curve cryptosystems over quartic extension fields of ...
To help motivate the Weil pairing, we discuss it in the context of elliptic curves over the field of...
In this paper we will prove a basic property of weil pairing which helps in evaluating its value. We...
Abstract. The Weil and Tate pairings are defined for elliptic curves over fields, including finite f...
Analyse, arithmétique et géométrie Pairings were first studied as potential attacks on elliptic curv...
AbstractUsing the Miller algorithm, we can efficiently compute the Weil pairing for two given points...