The Community for Technology Leaders
Green Image
In the current work, we propose a pipelining scheme for implementing Elliptic Curve Cryptosystems (ECC). The scalar multiplication is the dominant operation in ECC. It is computed by a series of point additions and doublings. The pipelining scheme is based on a key observation: To start the subsequent operation, one need not wait until the current one exits. The next operation can begin while a part of the current operation is still being processed. To our knowledge, this is the first attempt to compute the scalar multiplication in such a pipelined manner. Also, the proposed scheme can be made resistant to sidechannel attacks (SCA). Our scheme compares favorably with all SCA-resistant sequential and parallel methods.
Elliptic Curve Cryptosystems, ECC, EC-operations, pipelining, scalar multiplication, comb methods, binary methods, Jacobian coordinates, sidechannel attacks, sidechannel atomicity.

P. K. Mishra, "Pipelined Computation of Scalar Multiplication in Elliptic Curve Cryptosystems (Extended Version)," in IEEE Transactions on Computers, vol. 55, no. , pp. 1000-1010, 2006.
94 ms
(Ver 3.3 (11022016))