DocumentCode
491686
Title
A new scalar multiplication method suitable for hyperelliptic curve cryptosystems
Author
Xiao-e, Chen ; Lin, You
Author_Institution
Sch. of Math. & Stat., Hainan Normal Univ., Haikou
Volume
03
fYear
2009
fDate
15-18 Feb. 2009
Firstpage
1652
Lastpage
1656
Abstract
We describe a new scalar multiplication method for hyperelliptic curve cryptosystems. The method is obtained by the decomposition of the divisor into the simple divisors. The comparison results show that our method is much more efficient than Frobenius method and Double-and-Add method for some special hyperelliptic curves.
Keywords
public key cryptography; Frobenius method; double-and-add method; hyperelliptic curve cryptosystems; scalar multiplication method; Arithmetic; Elliptic curve cryptography; Elliptic curves; Equations; Galois fields; Jacobian matrices; Mathematics; Polynomials; Statistics; HECC; Scalar multiplication; Simple divisor;
fLanguage
English
Publisher
ieee
Conference_Titel
Advanced Communication Technology, 2009. ICACT 2009. 11th International Conference on
Conference_Location
Phoenix Park
ISSN
1738-9445
Print_ISBN
978-89-5519-138-7
Electronic_ISBN
1738-9445
Type
conf
Filename
4809390
Link To Document