Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms

DOI10.1007/978-3-540-85538-5_17zbMath1186.94438OpenAlexW1866966051MaRDI QIDQ3600509

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

Publication date: 10 February 2009

Published in: Pairing-Based Cryptography – Pairing 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85538-5_17

zbMATH Keywords

automorphismTate pairingMiller's algorithmefficient implementationgenus 2 non-supersingular hyperelliptic curve

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (1)

Faster pairing computation on genus \(2\) hyperelliptic curves

Cites Work

• The Weil pairing, and its efficient calculation
• Supersingular hyperelliptic curves of genus 2 over finite fields
• Efficient pairing computation on supersingular abelian varieties
• Ordinary Abelian varieties having small embedding degree
• The Eta Pairing Revisited
• Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 = x 5 + ax
• Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates
• 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
• Advances in Cryptology – CRYPTO 2004
• 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
• Faster Pairings Using an Elliptic Curve with an Efficient Endomorphism
• Selected Areas in Cryptography
• Selected Areas in Cryptography
• Information Security and Cryptology - ICISC 2003
• Automata, Languages and Programming
• Algorithmic Number Theory
• Advances in Cryptology - ASIACRYPT 2003
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms