6 search results - page 1 / 2 » Efficient Doubling on Genus 3 Curves over Binary Fields |
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 ...
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...
CHES
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. This paper presents a new shape for ordinary elliptic curves over fields of characteristic 2. Using the new shape, this paper presents the first complete addition formula...
PKC
2010
Springer
13 years 6 months ago
2010
Springer
This paper considers a generalized form for Hessian curves. The family of generalized Hessian curves covers more isomorphism classes of elliptic curves. Over a finite filed Fq, it ...
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....