摘要
椭圆曲线基点的判断是实现椭圆曲线密码系统（elliptic curve cryptosystems,ECC）的基础。提出了一种针对ECC的基点并行判断算法,此算法基于OpenMP共享存储模型,其并行效率在多核处理器平台上获得了显著的提高,最高达到了110%。实验表明,并行后的基点判断算法的运行速度相比并行前得到了明显提高;并行效率随着n（标量的二进制长度）的增大而逐渐趋于稳定;循环缓存容量对并行效率的提升没有影响;算法能够抵抗旁道攻击。因此,该算法可用于提高ECC基点的选取速度,进而提高整体加/解密速度。
Base-point judgment algorithm is the basis of ECC. This paper proposed a parallel base-point judgment algorithm based on OpenMP for ECC. Promoted the parallel efficiency of this algorithm significantly on multicore system with a maximum of approximate to 110 % . Moreover,investigated a comparison between this algorithm and the related algorithm,and gave the experimental data. The results show that the efficiency of the base-point judgment algorithm is obviously improved. As the binary size of scalar ascend,the parallel efficiency descends,and keeps stable at the end. In addition,the capacity of circular cache has no affect on parallel efficiency,the algorithm offers better security against SCA. Therefore,the proposed algorithm can be applied to speed up the selection of base-point,and then promote the efficiency of ECC.
出处
《计算机应用研究》
CSCD
北大核心
2010年第9期3545-3548,共4页
Application Research of Computers
