CryptoDB
Pairings on hyperelliptic curves with a real model
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2008-17927, title={Pairings on hyperelliptic curves with a real model}, booktitle={IACR Eprint archive}, keywords={implementation / hyperelliptic curves, pairings, real models}, url={http://eprint.iacr.org/2008/250}, note={ david.mireles@gmail.com 14032 received 2 Jun 2008}, author={Steven D. Galbraith and Xibin Lin and David Mireles}, year=2008 }