Pairings on Hyperelliptic Curves with a Real Model

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 − 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.

DOI: 10.1007/978-3-540-85538-5_18

Extracted Key Phrases

1 Figure or Table

Cite this paper

@inproceedings{Galbraith2008PairingsOH, title={Pairings on Hyperelliptic Curves with a Real Model}, author={Steven D. Galbraith and Xibin Lin and David J. Mireles Morales}, booktitle={Pairing}, year={2008} }