Paper 2008/250
Pairings on hyperelliptic curves with a real model
Steven Galbraith, Xibin Lin, and David Mireles
Abstract
We analyse the efficiency of pairing computations on hyperelliptic curves given by a real model using a balanced divisor at infinity. Several optimisations are proposed and analysed. Genus two curves given by a real model arise when considering pairing friendly groups of order dividing $p^{2}-p+1$. We compare the performance of pairings on such groups in both elliptic and hyperelliptic versions. We conclude that pairings can be efficiently computable in real models of hyperelliptic curves.
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- hyperelliptic curvespairingsreal models
- Contact author(s)
- david mireles @ gmail com
- History
- 2008-06-03: received
- Short URL
- https://ia.cr/2008/250
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2008/250,
author = {Steven Galbraith and Xibin Lin and David Mireles},
title = {Pairings on hyperelliptic curves with a real model},
howpublished = {Cryptology {ePrint} Archive, Paper 2008/250},
year = {2008},
url = {https://eprint.iacr.org/2008/250}
}
