8 search results - page 2 / 2 » Parallelizing Explicit Formula for Arithmetic in the Jacobia... |
AAECC
2005
Springer
13 years 4 months ago
2005
Springer
The ideal class group of hyperelliptic curves can be used in cryptosystems based on the discrete logarithm problem. In this article we present explicit formulae to perform the gro...
ITCC
2005
IEEE
13 years 10 months ago
2005
IEEE
Recently, a lot of effort has been done to investigate all kinds of explicit formulae for speeding up group operation of hyperelliptic curve cryptosystem (HECC). In this paper, ex...
CTRSA
2006
Springer
13 years 8 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 ...