Paper 2006/005

Pairing Calculation on Supersingular Genus 2 Curves

Colm O hEigeartaigh and Michael Scott

Abstract

In this paper we describe how to efficiently implement pairing calculation on supersingular genus~2 curves over prime fields. We find that pairing calculation on supersingular genus~2 curves over prime fields is efficient and a viable candidate for practical implementation. We also show how to eliminate divisions in an efficient manner when computing the Tate pairing, and how this algorithm is useful for curves of genus greater than one.

Note: Some changes in notation, some tables added and a section on theoretical analysis added.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Published elsewhere. Unknown where it was published
Keywords
Tate pairinghyperelliptic curvespairing computation
Contact author(s)
coheigeartaigh @ computing dcu ie
History
2006-05-24: revised
2006-01-04: received
See all versions
Short URL
https://ia.cr/2006/005
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2006/005,
      author = {Colm O hEigeartaigh and Michael Scott},
      title = {Pairing Calculation on Supersingular Genus 2 Curves},
      howpublished = {Cryptology ePrint Archive, Paper 2006/005},
      year = {2006},
      note = {\url{https://eprint.iacr.org/2006/005}},
      url = {https://eprint.iacr.org/2006/005}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.