基于边信道原子的椭圆曲线标量乘算法

摘要

This article brings forward an SPA（Simple Power Analysis）-resisting side-channel atomicity that can reduce the frequency of point doubling and point addition thus saving computation time.By exploiting Crypto＋ ＋ Library we implement our scalar multiplication algorithm for elliptic curve based in 160 bit prime field given by NIST and find that our algorithm is 37.6% faster than Montgomery Ladder algorithm.%提出了一种能够抵抗简单能量分析攻击的边信道原子结构,减少了椭圆曲线密码体制中标量乘的倍点和点加运算次数,从而节省了运算时间,最后通过调用Crypto＋＋库函数,对于NIST提供的160 bit素域上椭圆曲线编程实现算法,发现此算法的效率比Montgomery Ladder算法提高了37.6%。