基于大素数域的椭圆曲线密码设计与实现  

DESIGN AND IMPLEMENTATION OF ECC BASED ON LARGE PRIME NUMBER FIELD

作　　者：胡滟[1] 李彤[1,2] 崔妍妍[2] 颜开[1] 

机构地区：[1]云南大学信息学院,云南昆明650091 [2]云南大学软件学院,云南昆明650091

出　　处：《计算机应用与软件》2010年第8期44-48,共5页Computer Applications and Software

基　　金：国家自然科学基金项目(60463002);云南省应用基础研究基金项目(2007F008M)

摘　　要：为了能实现椭圆曲线密码高效加解密,给出一种基于大素数域的NIST推荐的192位以上的标准椭圆曲线加解密的程序结构,并实现了(192,224,256,384)四条椭圆曲线加解密。实验结果表明,采用多精度加减法、乘法以及除2等算法能够高效地得出加解密结果,从而使方案可适用于对加密性能要求较高的场合。To realize encryption and decryption of ECC efficiently, a standard and more than 192 bits ECC program structure of encryption and decryption is given in the paper. It is proposed by NIST and based on large prime number field. Besides, four （ 192bits, 224bits, 256bits, 384bits） ECC of cncryption and decryption are completed by the author. Experiments show that the use of algorithms in the paper, such as muhi-precision addition and subtraction, multiplication as well as division by 2 can efficiently get the results of encryption and decryp- tion, so that the new solution can be applied to occasions requiring higher performance of eneryption.

关 键 词：椭圆曲线密码 大数 点 密钥生成 加解密 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]