6 search results - page 1 / 2 » Construction of Hyperelliptic Curves with CM and Its Applica... |
ASIACRYPT
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...
IEICET
2008
13 years 4 months ago
2008
The hyperelliptic curve cryptosystems take most of the time for computing a scalar multiplication kD of an element D in the Jacobian JC of a hyperelliptic curve C for an integer k....
ASIACRYPT
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
ACISP
2005
Springer
13 years 10 months ago
2005
Springer
We deal with a divisor class halving algorithm on hyperelliptic curve cryptosystems (HECC), which can be used for scalar multiplication, instead of a doubling algorithm. It is not ...
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...