Title :
Improved elliptic curve cryptographic processor for general curves over GF(p)
Author :
Chen, Chuanpeng ; Qin, Zhongping
Author_Institution :
Sch. of Comput., Wuhan Univ., Wuhan, China
Abstract :
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.
Keywords :
Galois fields; affine transforms; critical path analysis; microprocessor chips; public key cryptography; Montgomery multiplication algorithm; affine coordinates; critical path delay; elliptic curve cryptographic processor; general curves; multiplication units; systolic modular division; Adders; Computer architecture; Elliptic curve cryptography; Elliptic curves; Hardware; Logic gates; Elliptic curve cryptography; hardware implementation; modular division; modular multiplication; systolic array;
Conference_Titel :
Signal Processing (ICSP), 2010 IEEE 10th International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4244-5897-4
DOI :
10.1109/ICOSP.2010.5656901
