素域上椭圆曲线密码的高效实现

素域上椭圆曲线密码的高效实现 Efficient Implementation of Elliptic Curve Crypto system over Prime Fields 汪朝晖 WANG Zhao-hui~1 1 2 3 4 first-author 陈建华 CHEN Jian-hua~1 1 2 3 4 涂航 TU Hang~2 1 2 3 4 李莉 LI Li~2 1 2 3 4 武汉大学数学与统计学院 武汉大学数学与统计学院 School of Mathematics and Statistics, Wuhan University School of Mathematics and Statistics, Wuhan University 武汉大学计算机学院 武汉大学计算机学院 School of Computer, Wuhan University School of Computer, Wuhan University 武汉大学计算机学院,湖北,武汉,430072 武汉大学计算机学院,湖北,武汉,430072 ,湖北,武汉,430072 ,湖北,武汉,430072 给出了几个素域上的算术运算和素域上椭圆曲线算术运算的高效实现算法,从而解决了椭圆曲线密码（ECC）实现中影响效率的几个关键算法设计问题,且就ECC加密机制和签名机制的选择提出了建议,最终形成一套高效的素域上ECC加密算法和签名算法的实现方案.该方案适应多种软件和硬件实现条件,具有较好的通用性. The authors present efficient algorithms for implementations of arithmetic operations in prime fields and elliptic curves over such fields, thus solved the issues of designing the key algorithms which lay great emphasis on the efficiencies of elliptic curve cryptosystems. The authors also gave suggestions about how to selecting efficient encryption schemes and signature schemes for elliptic curve cryptosystems. All those outcomes form a scenario of practical implementations of elliptic curve encryption algorithms and elliptic curve signature algorithms over prime fields, which is adaptive to many a software or hardware implementation environment and has pretty good generality. 椭圆曲线密码 加密 签名 elliptic curve cryptosystems encryption signature TN918 国家863计划基金资助项目（2001AA141010） 2004-03-01 2021-04-01 3