Fast elliptic curve algorithm combining frobenius map and table reference to adapt to higher characteristic

Abstract

A new elliptic curve scalar multiplication algorithm is proposed. The algorithm overs about twice the troughput of some conventional OEF-base algorithms because it combines the Frobenius map with the table reference method based on base-expansion. Furthermore, since this algorithm suits conventional computational units such as 16, 32 and 64 bits, its base field Fpm is expected to enhance elliptic curve operation eficiency more than Fq (q is a prime) or F2n.