一类安全椭圆曲线的选取及其标量乘法的快速计算  

A Selection of the Secure Elliptic Curve and Fast Calculation of Scalar Multiplication

作　　者：白国强[1] 周涛[1] 陈弘毅[1] 

机构地区：[1]清华大学微电子学研究所

出　　处：《电子学报》2002年第11期1654-1657,共4页Acta Electronica Sinica

基　　金：中国博士后科学基金 (No .0 2 32 0 2 0 0 1 ) ;国家 863项目 (No .2 0 0 2AA1 4 1 0 4 0 )

摘　　要：安全椭圆曲线的选取和标量乘法的快速计算是有效实现椭圆曲线密码体制的两个主要问题 .本文将二者结合起来考虑给出了一类适合普通PC机实现的安全椭圆曲线 ,并详细给出了选取这类曲线的具体步骤和基于“大步 小步法”思想构造了一种新的计算这类曲线上标量乘法的快速算法 .这类曲线不仅选取容易而且利用本文所提出方法计算其标量乘法时能使所需椭圆曲线运算次数大大减少 .此外 ,选用这类曲线后基域中元素不再需要专门的表示方法 ,各种运算能非常快地得到实现 。The selection of secure elliptic curves and the scalar multiplications of elliptic curves are two important problems in the practice of efficiently implementing an elliptic curve cryptosystems.In this paper,we study those two problems jointly,give a class of secure elliptic curves mainly based on the computer words,describe a detailed process of how to selecting those curves,and present a new method,which is based on the idea of 'baby step giant step',of computing the scalar multiplication concerning those curves.With the new method,the amount of scalar multiplications based on those curves can be reduced greatly. Besides,when those curves are used,special representation method for the elements in the base field is no longer needed,and all the arithmetic in the field can be quickly accomplished.

关 键 词：快速计算 椭圆曲线 密码 安全 标量乘法 Frobenius展式 信息安全 

分 类 号：TN918.1[电子电信—通信与信息系统]