Random point scalar multiplication on binary field GF(2 m) is one of the costliest computations in elliptic curve cryptography.

• 随机点点乘是椭圆曲线密码体制中最耗时的运算。