A new elliptic curve scalar multiplication algorithm is proposed. The algorithm o ers about twice the troughput of some conventional OEF-base algorithms because it combines the Frobenius map with the table reference method based on baseexpansion. Furthermore, since this algorithm suits conventional computational units such as 16, 32 and 64 bits, its base eld F p m is expected to enhance ellipti...