Efficient Pairing Computation on Elliptic Curves in Hessian Form

DOI10.1007/978-3-642-24209-0_11zbMath1292.94068OpenAlexW1751154003MaRDI QIDQ3094994

Haihua Gu, Wenlu Xie, Da-Wu Gu

Publication date: 27 October 2011

Published in: Information Security and Cryptology - ICISC 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24209-0_11

zbMATH Keywords

elliptic curveHessian formTate paring

Mathematics Subject Classification ID

Cryptography (94A60) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (2)

Division polynomials on the Hessian model of elliptic curves ⋮ Parallelizing pairings on Hessian elliptic curves

Uses Software

• EFD

This page was built for publication: Efficient Pairing Computation on Elliptic Curves in Hessian Form