International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

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

Authors:
Pradeep Kumar Mishra
Download:
URL: http://eprint.iacr.org/2004/191
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2004-12163,
  title={Scalar Multiplication in Elliptic Curve Cryptosystems: Pipelining with Pre-computations},
  booktitle={IACR Eprint archive},
  keywords={implementation / Elliptic Curve Cryptosystems, Pipelining, Scalar Multiplication, Jacobian coordinates, Comb methods, Window methods},
  url={http://eprint.iacr.org/2004/191},
  note={Preprint pradeep_t@isical.ac.in 12637 received 7 Aug 2004},
  author={Pradeep Kumar Mishra},
  year=2004
}