Eta pairing computation on general divisors over hyperelliptic curves y^2=x^p - x+d
From MaRDI portal
Publication:932799
DOI10.1016/J.JSC.2007.07.010zbMATH Open1143.14020OpenAlexW1975344255MaRDI QIDQ932799FDOQ932799
Authors: Hyang-Sook Lee, Eunjeong Lee, Yoonjin 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
Recommendations
- Eta Pairing Computation on General Divisors over Hyperelliptic Curves y 2 = x 7 − x ±1
- TATE PAIRING COMPUTATION ON THE DIVISORS OF HYPERELLIPTIC CURVES OF GENUS 2
- Advances in Cryptology - ASIACRYPT 2003
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
- Pairings on hyperelliptic curves
- On the analogue of the division polynomials for hyperelliptic curves.
- Formulae for computation of Tate pairing on hyperelliptic curve using hyperelliptic nets
- Ate Pairing on Hyperelliptic Curves
- Computing local \(p\)-adic height pairings on hyperelliptic curves
- Improved divisor arithmetic on generic hyperelliptic curves
Cryptography (94A60) Jacobians, Prym varieties (14H40) Finite ground fields in algebraic geometry (14G15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Formulae for arithmetic on genus 2 hyperelliptic curves
- 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
- Efficient pairing computation on supersingular abelian varieties
- The Eta Pairing Revisited
- Title not available (Why is that?)
- Factoring Polynomials Over Large Finite Fields
- Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
- Title not available (Why is that?)
- Title not available (Why is that?)
- Advances in Cryptology - ASIACRYPT 2003
- Ate Pairing on Hyperelliptic Curves
- Cryptography and Coding
- Identity-based authenticated key agreement protocol based on Weil pairing
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Selected Areas in Cryptography
- Information Security and Cryptology - ICISC 2003
Cited In (7)
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
- Tate and Ate pairings for \(y^2=x^5-\alpha x\) in characteristic five
- TATE PAIRING COMPUTATION ON THE DIVISORS OF HYPERELLIPTIC CURVES OF GENUS 2
- Advances in Cryptology - ASIACRYPT 2003
- Efficient multiplications in \(\mathbb F_5^{5n}\) and \(\mathbb F_7^{7n}\)
- Eta Pairing Computation on General Divisors over Hyperelliptic Curves y 2 = x 7 − x ±1
- The Eta Pairing Revisited
Uses Software
This page was built for publication: Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q932799)
