Paper 2011/044

Fast Scalar Multiplication in ECC using The Multi base Number System.

G. N. Purohit and Asmita Singh Rawat

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.

Note: I have submitted the paper typed in LaTeX.

Metadata
Available format(s)
PDF
Category
Applications
Publication info
Published elsewhere. Unknown where it was published
Keywords
elliptic curve cryptosystem
Contact author(s)
singh asmita27 @ gmail com
History
2011-01-25: received
Short URL
https://ia.cr/2011/044
License
Creative Commons Attribution
CC BY

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},
      note = {\url{https://eprint.iacr.org/2011/044}},
      url = {https://eprint.iacr.org/2011/044}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.