抄録
Elliptic curve cryptosystems can be constructed over a smaller definition field than the ElGamal cryptosystems or the RSA cryptosystems. This is why elliptic curve cryptosystems have begun to attract notice. This paper explores an efficient fixed-point-scalar-multiplication algorithm for the case of a definition field Fp (p>3) and adjusts coordinates to the algorithm proposed by Lim and Lee. Our adjusted algorithm can give better performance than the previous algorithm in some sizes of the pre-computed tables.
