Pradeep Mishra  
Dept. of  Mathematics and Statistics 
University of Calgary

Pipelined Computation of Scalar Multiplication in Elliptic Curve
Cryptosystems

Pipelining is a well-known technique in computer science. Scalar
multiplication is the computationally dominant operation in Elliptic curve
Cryptography. In this talk we discuss a pipelining scheme for implementing
scalar multiplication in Elliptic Curve Cryptosystems(ECC). Computation of
scalar multiplication is generally carried out by a series of point
addition and point doubling operations. The pipelining scheme is based on
the key observation: to start the subsequent operation one need not wait
till the current one exits. The next operation can begin while a part of
the current operation is still being processed. This simple observation
coupled with slightly more hardware support provides a significant
speed-up in the implementation of ECC.