Pairing calculation on supersingular genus 2 curves

Authors:
Colm Ó. hÉigeartaigh;Michael Scott
Affiliations:
School of Computing, Dublin City University, Dublin 9, Ireland;School of Computing, Dublin City University, Dublin 9, Ireland
Venue:
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
Year:
2006

Citing 12
Cited 4

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
Implementing the Tate Pairing

ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
A Public-Key Cryptosystem and a Digital Signature System BAsed on the Lucas Function Analogue to Discrete Logarithms

ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
The Weil Pairing, and Its Efficient Calculation

Journal of Cryptology
Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)

Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)
Implementation of cryptosystems based on Tate pairing

Journal of Computer Science and Technology
Efficient Algorithms for Tate Pairing

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
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
Computing the tate pairing

CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology

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

Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Pairings on Hyperelliptic Curves with a Real Model

Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
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
Hyperelliptic pairings

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we describe how to efficiently implement pairing calculation on supersingular genus 2 curves over prime fields. We find that, contrary to the results reported in [8], pairing calculation on supersingular genus 2 curves over prime fields is efficient and a viable candidate for the practical implementation of pairing-based cryptosystems. We also show how to eliminate divisions in an efficient manner when computing the Tate pairing, assuming an even embedding degree, and how this algorithm is useful for curves of genus greater than one.