Cryptology ePrint Archive: Report 2004/191

Scalar Multiplication in Elliptic Curve Cryptosystems: Pipelining with Pre-computations

Pradeep Kumar Mishra

Abstract: The pipelining scheme proposed in~\cite{PKM04} is an efficient and secure scheme for computing scalar multiplication in Elliptic Curve Cryptosystems (ECC). The scheme proposed in~\cite{PKM04} does not assume any pre-computation. In this work we extend the scheme to the situation where the system allows some pre-computation and is capable of storing some precomputed values. Like the scheme proposed in~\cite{PKM04} our scheme uses an extra multiplier. On the performance front, it outperforms the best known sequential and parallel schemes. On the security front, our algorithm uses two countermeasures against SPA and hence are doubly secured against SPA. Also, it is secure against DPA using the Joye-Tymen's curve randomization countermeasure.

Category / Keywords: implementation / Elliptic Curve Cryptosystems, Pipelining, Scalar Multiplication, Jacobian coordinates, Comb methods, Window methods

Publication Info: Preprint

Date: received 7 Aug 2004

Contact author: pradeep_t at isical ac in

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | BibTeX Citation

Version: 20040808:171606 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]