Hyperelliptic pairings

Authors:
Steven D. Galbraith;Florian Hess;Frederik Vercauteren
Affiliations:
Mathematics Department, Royal Holloway, University of London, Surrey, UK;Technische Universität Berlin, Berlin, Germany;Department of Electrical Engineering, Katholieke Universiteit Leuven, Leuven-Heverlee, Belgium
Venue:
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Year:
2007

Citing 27
Cited 8

Hyperelliptic cryptosystems

Journal of Cryptology
A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves

Mathematics of Computation
Identity-Based Encryption from the Weil Pairing

SIAM Journal on Computing
Efficient Algorithms for Pairing-Based Cryptosystems

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Supersingular Abelian Varieties in Cryptology

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems

EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Supersingular Curves in Cryptography

ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Implementing the Tate Pairing

ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Efficient Implementation of Pairing-Based Cryptosystems

Journal of Cryptology
A One Round Protocol for Tripartite Diffie–Hellman

Journal of Cryptology
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems

Journal of Cryptology
The Weil Pairing, and Its Efficient Calculation

Journal of Cryptology
Elliptic Curves Suitable for Pairing Based Cryptography

Designs, Codes and Cryptography
Efficient pairing computation on supersingular Abelian varieties

Designs, Codes and Cryptography
Ate Pairing on Hyperelliptic Curves

EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Pairing calculation on supersingular genus 2 curves

SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
Constructing elliptic curves with prescribed embedding degrees

SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Efficient doubling on genus two curves over binary fields

SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
Fast bilinear maps from the tate-lichtenbaum pairing on hyperelliptic curves

ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
High security pairing-based cryptography revisited

ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
Novel efficient implementations of hyperelliptic curve cryptosystems using degenerate divisors

WISA'04 Proceedings of the 5th international conference on Information Security Applications
Some improved algorithms for hyperelliptic curve cryptosystems using degenerate divisors

ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
Pairing-Based cryptography at high security levels

IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
The Eta Pairing Revisited

IEEE Transactions on Information Theory
Ordinary abelian varieties having small embedding degree

Finite Fields and Their Applications
Constructing pairing-friendly genus 2 curves with ordinary Jacobians

Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Eta pairing computation on general divisors over hyperelliptic curves y2 = x7 - x ± 1

Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography

Homomorphic Encryption and Signatures from Vector Decomposition

Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Generators for the l-Torsion Subgroup of Jacobians of Genus Two Curves

Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Efficient and generalized pairing computation on Abelian varieties

IEEE Transactions on Information Theory
Efficiently computable distortion maps for supersingular curves

ANTS-VIII'08 Proceedings of the 8th international conference on Algorithmic number theory
Optimal pairings

IEEE Transactions on Information Theory
On the efficiency and security of pairing-based protocols in the type 1 and type 4 settings

WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
Faster pairing computation on genus 2 hyperelliptic curves

Information Processing Letters
Genus 2 hyperelliptic curve families with explicit jacobian order evaluation and pairing-friendly constructions

Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography

Quantified Score

Hi-index	0.12

Visualization

Abstract

We survey recent research on pairings on hyperelliptic curves and present a comparison of the performance characteristics of pairings on elliptic curves and hyperelliptic curves. Our analysis indicates that hyperelliptic curves are not more efficient than elliptic curves for general pairing applications.