Elliptic Curve Scalar Multiplication Based on Point Halving and MBNS
Wan‐Su Bao · Jisuanji gongcheng · 2008
The fast implementation of elliptic curve cryptosystems relies on the efficient computation of scalar multiplication.On the curves with minimal two-torsion scalar multiplication based on point halving is more efficient than based on ordinary methods.A new method of point scalar multiplication based on MBNS using point halving is presented.This new method enhances scalar multiplication efficiently.