改进的素数域椭圆曲线密码处理器  

An improved elliptic curve cryptographic processor over GF(p)

作　　者：陈传鹏[1] 覃中平[2] 

机构地区：[1]武汉大学计算机学院,湖北武汉430079 [2]华中科技大学软件学院,湖北武汉430074

出　　处：《武汉大学学报（工学版）》2011年第1期124-127,132,共5页Engineering Journal of Wuhan University

基　　金：国家自然科学基金资助项目(编号:60673071);国家863计划资助项目(编号:2006AA01Z442;2007AA01Z411)

摘　　要：椭圆曲线密码算法的核心是点乘算法,由点加和点倍运算实现.通过采用仿射坐标,点加运算需要1次模除与4次Montgomery乘法,点倍运算需要1次模除与6次Montgomery乘法.通过采用一个统一的模除与Mont-gomery乘算法,使得硬件实现中仅需要1个算术运算器.素数域椭圆曲线密码处理器的核心是一个脉动算术运算阵列,其3级流水结构可以并行计算点运算中模除与Montgomery乘,以减少点运算的时间;通过改进核心的脉动算术运算单元,减少其关键路径延时以提高处理器的计算速度.仿真结果表明改进的处理器有效地提高了椭圆曲线密码处理器的计算速度.An improved high-performance elliptic curve cryptographic（ECC） processor for general curves over GF（p） is introduced.The core part of ECC system is the point scalar multiplication algorithm composed by point addition and point doubling operations.By using affine coordinates,the point addition needs one modular division and four Montgomery multiplications;and the point doubling needs one modular division and six Montgomery multiplications.A unified modular division/Montgomery multiplication algorithm is introduced to perform both modular division and Montgomery multiplication.Therefore,in the hardware implementation of ECC processor,only one arithmetic unit is needed.This arithmetic unit uses a pipeline structure to perform modular division and Montgomery multiplication parallel.So the computational time is reduced.Furthermore,an improvement of a less critical path delay has been achieved for the systolic arithmetic unit to increase the computational speed of the ECC processor.The synthesis results show that the improved elliptic curve cryptographic processor gains high performance.

关 键 词：椭圆曲线 密码术 硬件实现 脉动阵列 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]