Improved Elliptic Curve Scalar Multiplication Using Triple Formula

摘要

Elliptic Curve Cryptosystems (ECC) has attracted much attention because of its short key size in comparison to other public key Cryptosystems. In ECC, the most dominant computation part is scalar multiplication, which computes kP for a given point P and a scalar k. This is why several algorithms aiming at fast scalar multiplication have been proposed so far. In this paper, we propose two efficient ternary algorithm, ternary signed-digit method and extended ternary signed-digit method. The proposed algorithms are resistant against SPA and SEA attacks, and offer lower computation cost than previous ones.