Paper 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.
Metadata
- Available format(s)
- PS
- Category
- Implementation
- Publication info
- Published elsewhere. Preprint
- Keywords
- Elliptic Curve CryptosystemsPipeliningScalar MultiplicationJacobian coordinatesComb methodsWindow methods
- Contact author(s)
- pradeep_t @ isical ac in
- History
- 2004-08-08: received
- Short URL
- https://ia.cr/2004/191
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2004/191,
author = {Pradeep Kumar Mishra},
title = {Scalar Multiplication in Elliptic Curve Cryptosystems: Pipelining with Pre-computations},
howpublished = {Cryptology {ePrint} Archive, Paper 2004/191},
year = {2004},
url = {https://eprint.iacr.org/2004/191}
}
