Pairing-Friendly Twisted Hessian Curves

  title={Pairing-Friendly Twisted Hessian Curves},
  author={Chitchanok Chuengsatiansup and Chloe Martindale},
  journal={IACR Cryptol. ePrint Arch.},
This paper presents efficient formulas to compute Miller doubling and Miller addition utilizing degree-3 twists on curves with j-invariant 0 written in Hessian form. We give the formulas for both odd and even embedding degrees and for pairings on both \(\mathbb {G}_1 \times \mathbb {G}_2\) and \(\mathbb {G}_{2} \times \mathbb {G}_{1}\). We propose the use of embedding degrees 15 and 21 for 128-bit and 192-bit security respectively in light of the NFS attacks and their variants. We give a… 
3 Citations
Cocks–Pinch curves of embedding degrees five to eight and optimal ate pairing computation
This work extends the Cocks–Pinch algorithm to obtain pairing-friendly curves with an efficient ate pairing, and targets a 128-bit security level, and backs this security claim by time estimates for the DLP computation.
A new cryptosystem based on a twisted Hessian curve $$H^{4}_{a,d}$$
A new public key Cryptosystem which is a variant of Cramer-Shoup public key cryptosystem on a twisted Hessian curves and study its security and efficiency, which is beneficial and interesting in cryptography.


Pairing Computation on Edwards Curves with High-Degree Twists
The geometry approach is used to explain the group law for general elliptic curves given by intersection of two quadratic surfaces, then the Miller function is constructed over the intersection of quadRatic surfaces.
Pairing-Friendly Elliptic Curves of Prime Order
This paper describes a method to construct elliptic curves of prime order and embedding degree k = 12 and shows that the ability to handle log(D)/log(r) ~ (q–3)/(q–1) enables building curves with ρ ~ q/(q-1).
Optimal Ate Pairing on Elliptic Curves with Embedding Degree 9, 15 and 27
This work improves the theoretical cost for the Miller step and the final exponentiation using the lattice-based method and finds that elliptic curves with embedding degree $k=15$ present faster results than BN12 curves at the 128-bit security level.
Faster Computation of the Tate Pairing
Computing the Ate Pairing on Elliptic Curves with Embedding Degree k = 9
This paper presents efficient methods for the k = 9 case, including generation of elliptic curves with the shorter Miller loop, the denominator elimination and speed up of the final exponentiation, and concludes that for pairing-based cryptography at the AES 128 security level, the Barreto-Naehrig curves are the most efficient choice.
Efficient Pairing Computation on Elliptic Curves in Hessian Form
This paper gives the geometric interpretation of the group law on Hessian curves and proposes the first algorithm for computing the Tate pairing on elliptic curves in Hessian form, which indicates that it is faster than all algorithms of Tate pairing computation known so far.
A study of pairing computation for elliptic curves with embedding degree 15
It is shown that pairing computation on these curves has loop length r 1 / 8 and the use a twist of degree 3 to perform most of the operations in F p or F p 5.
Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
We describe a new method for constructing Brezing-Weng-like pairing-friendly elliptic curves. The new construction uses the minimal polynomials of elements in a cyclotomic field. Using this new
The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$
The Special Number Field Sieve is extended to compute discrete logarithms in $\mathbb{F}_{p^{n}}$ , where p has an adequate sparse representation and the improved algorithm works for the whole range of applicability of the Number field Sieve.
A Taxonomy of Pairing-Friendly Elliptic Curves
This paper gives a single coherent framework that encompasses all of the constructions of pairing-friendly elliptic curves currently existing in the literature and provides recommendations as to which pairing- friendly curves to choose to best satisfy a variety of performance and security requirements.