低存储需求的快速标量乘法算法

摘要

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 left-to-right 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.%在椭圆曲线密码体制(ECC)中,标量乘法的运算时间和存储资源消耗较大.为此,借助标量的2MOF表示,利用混合坐标系下直接计算2Q+P的策略,提出一种低存储需求的从左向右标最乘法算法.理论及实例分析表明,该算法的时间和空间消耗较少,能有效提高ECC在资源受限环境中的实现效率.