Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\)

DOI10.1016/j.jsc.2007.07.010zbMath1143.14020OpenAlexW1975344255MaRDI QIDQ932799

Hyang-Sook Lee, Yoon-Jin Lee, Eun Jeong Lee

Publication date: 11 July 2008

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2007.07.010

zbMATH Keywords

hyperelliptic curvesresultantdivisorsTate pairingpairing-based cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Jacobians, Prym varieties (14H40) Finite ground fields in algebraic geometry (14G15)

Related Items (1)

Efficient multiplications in \(\mathbb F_5^{5n}\) and \(\mathbb F_7^{7n}\)

Uses Software

• NTL
• SINGULAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Formulae for arithmetic on genus 2 hyperelliptic curves
• Efficient pairing computation on supersingular abelian varieties
• The Eta Pairing Revisited
• Identity-based authenticated key agreement protocol based on Weil pairing
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• An Identity-Based Signature from Gap Diffie-Hellman Groups
• Ate Pairing on Hyperelliptic Curves
• Factoring Polynomials Over Large Finite Fields
• Selected Areas in Cryptography
• Information Security and Cryptology - ICISC 2003
• Tata lectures on theta. II: Jacobian theta functions and differential equations. With the collaboration of C. Musili, M. Nori, E. Previato, M. Stillman, and H. Umemura
• Cryptography and Coding
• Advances in Cryptology - ASIACRYPT 2003
• Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato

This page was built for publication: Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\)