6 search results - page 2 / 2 » Faster Explicit Formulas for Computing Pairings over Ordinar... |
CTRSA
2006
Springer
13 years 11 months ago
2006
Springer
The most important and expensive operation in a hyperelliptic curve cryptosystem (HECC) is scalar multiplication by an integer k, i.e., computing an integer k times a divisor D on ...