A study of pairing computation for curves with embedding
نویسندگان
چکیده
This paper presents the first study of pairing computation on curves with embedding degree 15. We compute the Ate and the twisted Ate pairing for a family of curves with parameter ρ 1.5 and embedding degree 15. We use a twist of degree 3 to perform most of the operations in Fp or Fp5 . Furthermore, we present a new arithmetic for extension fields of degree 5. Our computations show that these curves give very efficient implementations for pairing-based cryptography at high security levels. Key-words: Pairing based cryptography, Pairing computation, Arithmetic, Interpolation, Elliptic Curves, Embedding degree, Security level.
منابع مشابه
Pairing computation for elliptic curves
This paper presents the first study of pairing computation on curves with embedding degree 15. We show that pairing computation on these curves has loop length r and we use a twist of degree 3 to perform most of the operations in Fp or Fp5 . Furthermore, we present an original arithmetic for extension fields of degree 5. Key-words: Pairing based cryptography, Pairing computation, Arithmetic, In...
متن کاملPairing Computation on Elliptic Curves with Efficiently Computable Endomorphism and Small Embedding Degree
Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a particular class of curves with embedding degree 2. He points out that pairing implementation becomes thus faster on these curves than on their supersingular equivalent, originally recommended by Boneh and Franklin for Identity Based Encryption. We extend Scott’s method to other classes of curves with...
متن کاملFaster Pairing Computation
This paper proposes new explicit formulas for the doubling and addition step in Miller’s algorithm to compute pairings. For Edwards curves the formulas come from a new way of seeing the arithmetic. We state the first geometric interpretation of the group law on Edwards curves by presenting the functions which arise in the addition and doubling. Computing the coefficients of the functions and th...
متن کاملFaster Computation of Self-pairings.dvi
Self-pairings have found interesting applications in cryptographic schemes, such as ZSS short signatures and so on. In this paper, we present a novel method for constructing a self-pairing on supersingular elliptic curves with even embedding degrees, which we call the Ateil pairing. This pairing improves the efficiency of the self-pairing computation on supersingular curves over finite fields w...
متن کاملPairing for Elliptic Curves with Embedding Degree 1 Defined over Prime Order Fields
In the last years, prime order pairing-based cryptography has received much attention. The embedding degree 1 is very appealing because the computations can be performed without any extension fields, but the efficiency parameter and this particular value of the embedding degree imposes some limits about the possible curves. This paper presents an analysis of the existing algorithms for construc...
متن کامل