Skip to Main content Skip to Navigation
Theses

Pairing computation and arithmetic of elliptic curves for cryptography

Abstract : 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 with even embedding degree, we define and use the quadratic twist of this curve to obtain efficient formulas in the doubling and addition stages in Miller's algorithm. Moreover, for pairing computation with embedding degree divisible by 4 on the special Jacobi quartic elliptic curve Ed :Y²=dX⁴+Z⁴, we define and use its quartic twist to obtain a best result with respect to Weierstrass curves. Our result is at the same time an improvement of a result recently obtained on this curve, and is therefore, to our knowledge, the best result to date on Tate pairing computation among all curves with quartic twists. In 2006, Hess et al. introduced the concept of Ate pairing which is an improving version of the Tate pairing. We extend the computation of this pairing and its variations to the curve E_d. Again our theoretical results show that this curve offers the best performances comparatively to other curves with quartic twists, especially Weiertrass curves. As a third contribution, we introduce a new Edwards model for elliptic curves with equation 1+x²+y²+x²y²=\lambda xy. This model is ordinary over binary fields and we show that it is birationally equivalent to the well known Edwards model x²+y²=c²(1+x²y²) over non-binary fields. For this, we use the theory of theta functions to obtain an intermediate model that we call the level 4 theta model. We study the arithmetic of these curves, using Riemann relations of theta functions. The group laws are complete, unified, efficient and are particularly competitive in characteristic 2. Our formulas for differential addition on the level four theta model over binary fields are the best to date among well known models of elliptic curves.
Document type :
Theses
Complete list of metadatas

Cited literature [1 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00919779
Contributor : Abes Star :  Contact
Submitted on : Tuesday, December 17, 2013 - 12:11:18 PM
Last modification on : Friday, July 10, 2020 - 4:04:58 PM
Long-term archiving on: : Monday, March 17, 2014 - 11:05:25 PM

File

FOUOTSA_Emmanuel.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-00919779, version 1

Citation

Emmanuel Fouotsa. Pairing computation and arithmetic of elliptic curves for cryptography. General Mathematics [math.GM]. Université Rennes 1, 2013. English. ⟨NNT : 2013REN1S070⟩. ⟨tel-00919779⟩

Share

Metrics

Record views

811

Files downloads

432