A timing-and-area tradeoff GF(p) elliptic curve processor architecture for FPGA
Shuhua Wu, Zhu Yuefei · 2005
This paper presents a timing-and-area tradeoff elliptic curve processor architecture which can compute point multiplication with an arbitrary point on an elliptic curve over the field GF(p) (where p is any 192-bit prime integer) in 6.0 ms using relatively fewer resources. The Montgomery modular multiplication is optimized for the elliptic curve processor by avoiding the final comparison. All the other field arithmetic operations involved are performed efficiently also with no comparison by mostly exploiting the features of the arithmetic unit to deliver well-pipelined computations. Furthermore, an efficient method, called the decomposition and composition of a finite state machine, is adopted in this paper to design the controllers of the elliptic curve processor.