Fast Scalar Multiplication Algorithm with Low Memory Requirement
Zhong Li, Peng Dai-yuan · Jisuanji gongcheng · 2012
(Abstract )The scalar multiplication of Elliptic Curve Cryptosysytem(ECC) has big computational costs and memory consumption. Aiming at this problem, by means of the 2MOF representation of scalar, this paper uses the direct computation 2Q+P strategy, proposes a lower memory cost and some efficient left0to0right scalar multiplication algorithm. The analysis result indicates that this algorithm has lower computational cost and memory consumption, and can enhance the ECC's efficiency in resource constrained environment.