Issue No. 08 - August (2004 vol. 53)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2004.43
<p><b>Abstract</b>—We present a careful analysis of elliptic curve point multiplication methods that use the point halving technique of Knudsen and Schroeppel and compare these methods to traditional algorithms that use point doubling. The performance advantage of halving methods is clearest in the case of point multiplication <tmath>kP</tmath>, where <tmath>P</tmath> is not known in advance and smaller field inversion to multiplication ratios generally favor halving. Although halving essentially operates on affine coordinate representations, we adapt an algorithm of Knuth to allow efficient use of projective coordinates with halving-based windowing methods for point multiplication.</p>
Public key cryptosystems, computer arithmetic, efficiency.
Kenny Fong, Darrel Hankerson, Julio L?pez, Alfred Menezes, "Field Inversion and Point Halving Revisited", IEEE Transactions on Computers, vol. 53, no. , pp. 1047-1059, August 2004, doi:10.1109/TC.2004.43