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.