Fast point operation architecture for Elliptic Curve Cryptography

Elliptic curve cryptography (ECC) plays an important role in todaypsilas public key based security systems. Compared with the conventional systems such as RSA, ECC delivers much higher security strength per bit. The implementation of ECC lies in three levels: scalar multiplication, point addition/doubling and finite field modular arithmetic. In this paper, we present a novel fast architecture for the point addition/doubling level in the projective coordinate. Analysis shows that, with reasonable hardware overhead, our architecture can achieve a speedup of 2.5 times for the point addition operation in Lopez-Dahab projective coordinate and 1.8 times for the point doubling operation, which facilitates the design of high-speed ECC systems.