Paper 2011/044 Original: eprint.iacr.org/2011/044 ↗
Fast Scalar Multiplication in ECC using The Multi base Number System.
Abstract
As a generalization of double base chains, multibase number system is very suitable for efficient computation of scalar multiplication of a point of elliptic curve because of shorter representation length and hamming weight. In this paper combined with the given formulas for computing the 7- Fold of an elliptic curve point P an efficient scalar multiplication algorithm of elliptic curve is proposed using 2,3 and 7 as basis of the multi based number system . The algorithms cost less compared with Shamirs trick and interleaving with NAFs method.
Metadata
- Available format(s)
PDF- Category
- Applications
- Publication info
- Preprint.
- History
- 2011-01-25: last updated
- 2011-01-25: published
- Short URL
- https://ia.cr/2011/044
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2011/044,
author = {G. N. Purohit and Asmita Singh Rawat},
title = {Fast Scalar Multiplication in ECC using The Multi base Number System.},
howpublished = {Cryptology {ePrint} Archive, Paper 2011/044},
year = {2011},
url = {https://eprint.iacr.org/2011/044}
}