Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates

DOI10.1007/978-3-642-04159-4_2zbMath1256.94049OpenAlexW1529567625MaRDI QIDQ3644190

David D. W. Yao, Guang Gong, Xin-Xin Fan

Publication date: 3 November 2009

Published in: Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04159-4_2

zbMATH Keywords

projective coordinatesTate pairingMiller's algorithmefficient implementationgenus-2 hyperelliptic curves

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 (4)

Group Law Computations on Jacobians of Hyperelliptic Curves ⋮ Faster pairing computation on genus \(2\) hyperelliptic curves ⋮ Fast scalar multiplication of degenerate divisors for hyperelliptic curve cryptosystems ⋮ Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms

Uses Software

• MIRACL

Cites Work

• 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
• Ordinary Abelian varieties having small embedding degree
• The Eta Pairing Revisited
• 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
• Identity-Based Encryption from the Weil Pairing
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Pairing Calculation on Supersingular Genus 2 Curves
• Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians
• Eta Pairing Computation on General Divisors over Hyperelliptic Curves y 2 = x 7 − x ±1
• Ate Pairing on Hyperelliptic Curves
• Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
• 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
• Algorithmic Number Theory
• Advances in Cryptology - ASIACRYPT 2003

This page was built for publication: Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates