While first used to solve the Discrete Logarithm Problem (DLP) in the group of points of elliptic curves, bilinear pairings are now useful to construct many public key protocols. The efficiency of pairings computation depends on the arithmetic of the model chosen for the elliptic curve and of the base field where the curve is defined. In this thesis, we compute and implement pairings on elliptic curves of Jacobi forms and we study the arithmetic of a new Edwards model for elliptic curves defined over any finite field. More precisely, We use the geometric interpretation of the group law of Jacobi intersection curves to obtain the first explicit formulas for the Miller function in Tate pairing computation in this case. For pairing computation...
This paper proposes new explicit formulas for the doubling and addition steps in Miller's algorithm ...
This paper proposes new explicit formulas for the doubling and addition steps in Miller's algorithm ...
This paper proposes new explicit formulas for the doubling and addition steps in Miller's algorithm ...
Alors qu'initialement utilisés pour résoudre le Problème du Logarithme Discret (DLP) dans le groupe ...
International audienceThis paper proposes the computation of the Tate pairing, Ate pairing and its v...
International audienceThis paper proposes the computation of the Tate pairing, Ate pairing and its v...
This paper proposes explicit formulae for the addition step and doubling step in Miller\u27s algorit...
International audienceThis paper proposes the computation of the Tate pairing, Ate pairing and its v...
ISBN : 978-3-642-36333-7International audienceWe propose for the first time the computation of the T...
ISBN : 978-3-642-36333-7International audienceWe propose for the first time the computation of the T...
ISBN : 978-3-642-36333-7International audienceWe propose for the first time the computation of the T...
This paper proposes the computation of the Tate pairing, Ate pairing and its variations on the speci...
International audienceThis paper proposes the computation of the Tate pairing, Ate pairing and its v...
This paper proposes new explicit formulas for the doubling and addition steps in Miller's algorithm ...
This paper proposes new explicit formulas for the doubling and addition steps in Miller's algorithm ...
This paper proposes new explicit formulas for the doubling and addition steps in Miller's algorithm ...
This paper proposes new explicit formulas for the doubling and addition steps in Miller's algorithm ...
This paper proposes new explicit formulas for the doubling and addition steps in Miller's algorithm ...
Alors qu'initialement utilisés pour résoudre le Problème du Logarithme Discret (DLP) dans le groupe ...
International audienceThis paper proposes the computation of the Tate pairing, Ate pairing and its v...
International audienceThis paper proposes the computation of the Tate pairing, Ate pairing and its v...
This paper proposes explicit formulae for the addition step and doubling step in Miller\u27s algorit...
International audienceThis paper proposes the computation of the Tate pairing, Ate pairing and its v...
ISBN : 978-3-642-36333-7International audienceWe propose for the first time the computation of the T...
ISBN : 978-3-642-36333-7International audienceWe propose for the first time the computation of the T...
ISBN : 978-3-642-36333-7International audienceWe propose for the first time the computation of the T...
This paper proposes the computation of the Tate pairing, Ate pairing and its variations on the speci...
International audienceThis paper proposes the computation of the Tate pairing, Ate pairing and its v...
This paper proposes new explicit formulas for the doubling and addition steps in Miller's algorithm ...
This paper proposes new explicit formulas for the doubling and addition steps in Miller's algorithm ...
This paper proposes new explicit formulas for the doubling and addition steps in Miller's algorithm ...
This paper proposes new explicit formulas for the doubling and addition steps in Miller's algorithm ...
This paper proposes new explicit formulas for the doubling and addition steps in Miller's algorithm ...