Improved Elliptic Curve Cryptographic Processor for General Curves over GF(p)

摘要：

This paper introduces an improved high-performance elliptic curve cryptographic processor for general curves over GF(p), which is based on affine coordinates and systolic modular division and multiplication units. In this paper, we introduces a unified modular division and Montgomery multiplication algorithm, and make an improvement of the systolic modular division and multiplication unit to reduce the critical path delay by 18 percent. The results show that the improved elliptic curve cryptographic processor gains a higher-performance.

关键词： Elliptic curve cryptography modular division modular multiplication hardware implementation systolic array

作者: Chuanpeng Chen Zhongping Qin

作者单位: School of Computer, Wuhan University, Wuhan, China School of Software Engineering, Huazhong University of Science and Technology, Wuhan, China

会议类型: 国际会议

会议名称: 2010 IEEE 10th International Conference on Signal Processing(第十届信号处理国际会议 ICSP 2010)

会议地点: 北京

会议语种:英文

页码: 1849-1852

在线出版日期: 2010-08-24（万方平台首次上网日期，不代表论文的发表时间）