| Autor: |
Galbraith, Steven D., Lin, Xibin, Mireles Morales, David J. |
| Zdroj: |
Pairing-based Cryptography - Pairing 2008; 2008, p265-281, 17p |
| Abstrakt: |
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 p2− 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. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
