A High-Performance Elliptic Curve Cryptographic Processor for General Curves Over <formula formulatype="inline"><tex>GF(p)</tex></formula> Based on a Systolic Arithmetic Unit

This brief presents a high-performance elliptic curve cryptographic processor for general curves over GF(p), which features a systolic arithmetic unit. We propose a new unified systolic array that efficiently implements addition, subtraction, multiplication and division over GF(p). At the system level, the control dependencies in the operation sequence and the mismatched communication between the systolic array and the separate storage would stall the pipeline in the systolic array. These pipeline stalls are successfully avoided by using two optimization methods. Synthesized in 0.13-mum standard-cell technology, the processor requires 1.01 ms to compute a 256-bit scalar multiplication for general curves over GF(p)