椭圆曲线密码基础算法及其实现  

Elliptic Curve Cryptosystem Algorithms and Implementation

作　　者：孙金龙[1] 汪玉[2] 阳凌怡[1] 祝佳[1] 

机构地区：[1]武汉大学数学与统计学院,湖北武汉430072 [2]武汉大学密码研究中心,湖北武汉430072

出　　处：《武汉理工大学学报（信息与管理工程版）》2007年第5期33-36,共4页Journal of Wuhan University of Technology：Information & Management Engineering

摘　　要：就椭圆曲线密码的基础算法从整体角度给出了新的模加、模减算法结构,并针对这种模加模减运算形成的模乘算法给出了一种精简的硬件实现结构。该结构具有占用资源少、运算速度快的特点。并且针对ECC点乘算法的实现问题进行了进一步研究,给出了一种改进的简洁高效的实现方法。Providing on the basic algorithm of Elliptic curve cryptosystems, a new structure for module addition and module subtraction algorithm is proposed. Moreover, a kind of hardware Simplified and implemented structure are provided for module multiplication algorithm that operating on the improved module addition and module subtraction algorithms. This structure takes up the fast characteristic of making operation few of resource. Further research to the problem of implementation of ECC multiplication algorithm is carried on, and an improved succinct and high- efficient implementation method is designed.

关 键 词：椭圆曲线密码 模加算法 蒙哥马利模乘算法 椭圆曲线点乘算法 

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