Issue No. 08 - August (2002 vol. 51)
<p>In this paper, we propose a new addition formula in projective coordinates for elliptic curves over GF(2^n). The new formula speeds up the elliptic curve scalar multiplication by reducing the number of field multiplications. This was achieved by rewriting the elliptic curve addition formula. The complexity analysis shows that the new addition formula speeds up the addition in projective coordinates by about 10-2 percent, which leads to enhanced scalar multiplication methods for random and Koblitz curves.</p>
Public-key cryptography, elliptic curves, point addition, projective coordinates, scalar multiplication.
E. Al-Daoud, R. Mahmod, M. Rushdan and A. Kilicman, "A New Addition Formula for Elliptic Curves over GF(2^n)," in IEEE Transactions on Computers, vol. 51, no. , pp. 972-975, 2002.