|
|
 |
|
|
| Decomposition of an integer for efficient implementation of Elliptic Curve Cryptosystem |
| Young-Ho Park |
Pages. 45-51   |
|
 |
This paper presents the Gallant-Lambert-Vanstone method for
speeding up scalar multiplication of elliptic curves and an
alternate decomposition method using the theory of $mu$-Euclidean
algorithm. Also the extended method to hyperelliptic curves over
finite fields that have efficiently-computable endomorphisms is
presented. |
 |
1. Introduction
2. Gallant-Lambert-Vanstone method
3. Upper bounds on the components $k_1, k_2$
4. Extended method to hyperelliptic curves
5. Conclusion |
 |
| Elliptic Curve Cryptosystem, Hyperelliptic Curve, Scalar Multiplication, Decomposition of integer |
|
|
|
| |
|
|
