Title
Speeding Up Point Multiplication on Hyperelliptic Curves with Efficiently-Computable Endomorphisms
Abstract
As Koblitz curves were generalized to hyperelliptic Koblitz curves for faster point multiplication by G眉nter, et al. [10] we extend the recent work of Gallant, et al. [8] to hyperelliptic curves. So the extended method for speeding point multiplication applies to a much larger family of hyperelliptic curves over finite fields that have efficiently-computable endomorphisms. For this special family of curves, a speedup of up to 55 (59) % can be achieved over the best general methods for a 160-bit point multiplication in case of genus g =2 (3).
Year
DOI
Venue
2002
10.1007/3-540-46035-7_13
EUROCRYPT
Keywords
Field
DocType
extended method,hyperelliptic curve,hyperelliptic curves,finite field,special family,160-bit point multiplication,point multiplication,efficiently-computable endomorphisms,larger family,faster point multiplication,koblitz curve
Discrete mathematics,Characteristic polynomial,Hyperelliptic curve,Finite field,Family of curves,Multiplication,Hyperelliptic curve cryptography,Elliptic curve,Mathematics,Endomorphism
Conference
Volume
ISSN
ISBN
2332
0302-9743
3-540-43553-0
Citations 
PageRank 
References 
12
0.70
16
Authors
3
Name
Order
Citations
PageRank
Young-Ho Park113716.79
Sangtae Jeong2293.08
JongIn Lim381975.16