Faster pairing computation on genus \(2\) hyperelliptic curves
From MaRDI portal
Publication:1944931
DOI10.1016/j.ipl.2011.02.011zbMath1260.94057MaRDI QIDQ1944931
Yanfeng Qi, Mao-Zhi Xu, Chun-Ming Tang
Publication date: 28 March 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.02.011
cryptography; pairing-based cryptography; pairing computation; efficiently computable endomorphisms; genus-\(2\) hyperelliptic curves
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Hyperelliptic cryptosystems
- The Magma algebra system. I: The user language
- The Weil pairing, and its efficient calculation
- Efficient pairing computation on supersingular abelian varieties
- The Eta Pairing Revisited
- Identity-based authenticated key agreement protocol based on Weil pairing
- Pairing Lattices
- Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms
- Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates
- Computing in the Jacobian of a Hyperelliptic Curve
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- Reducing elliptic curve logarithms to logarithms in a finite field
- An Identity-Based Signature from Gap Diffie-Hellman Groups
- Efficient and Generalized Pairing Computation on Abelian Varieties
- Optimal Pairings
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Hyperelliptic Pairings
- Ate Pairing on Hyperelliptic Curves
- Information Security and Cryptology - ICISC 2003
- Advances in Cryptology - ASIACRYPT 2003