Pairing-friendly twisted Hessian curves

Pairings on elliptic curves are used as building blocks in various cryptographic applications such as identity-based and attribute-based encryption, privacy-enhancing and anonymity-preserving protocols, and key establishment schemes. The performance of pairing-based cryptography relies on elliptic-curve-point arithmetic, computation of line functions and pairing algorithms. In this talk, I'll present pairings on twisted Hessian curves where our formulas give the fastest known pairing computation for embedding degrees 15, 21, and 24. Our fast pairings on twisted Hessian curves are possible thanks to an applicability of utilizing degree-3 twist, reasonably fast point-arithmetic formulas compared to Weierstrass model, and fast line function computation compared to Edwards model.