36 search results - page 2 / 8 » Montgomery Scalar Multiplication for Genus 2 Curves |
DCC
2006
IEEE
14 years 5 months ago
2006
IEEE
Recently, Eisentr?ager et al. proposed a very elegant method for speeding up scalar multiplication on elliptic curves. Their method relies on improved formulas for evaluating S = (...
ACISP
2005
Springer
13 years 12 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 ...
CTRSA
2006
Springer
13 years 10 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 ...
CHES
2000
Springer
13 years 10 months ago
2000
Springer
This work proposes a processor architecture for elliptic curves cryptosystems over fields GF(2m ). This is a scalable architecture in terms of area and speed that exploits the abil...
ASIACRYPT
2006
Springer
13 years 10 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...