An optimal Tate pairing computation using Jacobi quartic elliptic curves

DOI10.1007/S10878-018-0257-YzbMath1418.90254OpenAlexW2788557196MaRDI QIDQ1752615

Roselyn Kaondera-Shava, Srinath Doss

Publication date: 24 May 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-018-0257-y

zbMATH Keywords

optimizationTate pairingJacobi quartic elliptic curves

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient computation of pairings on Jacobi quartic elliptic curves
• A taxonomy of pairing-friendly elliptic curves
• Faster computation of the Tate pairing
• Jacobi Quartic Curves Revisited
• Elliptic Curve Cryptosystems
• Identity-Based Encryption from the Weil Pairing
• Tate Pairing Computation on Jacobi’s Elliptic Curves

This page was built for publication: An optimal Tate pairing computation using Jacobi quartic elliptic curves