A new addition formula for elliptic curves over GF(2n)

41Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we propose a new addition formula in projective coordinates for elliptic curves over GF(2n). 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.

Cite

CITATION STYLE

APA

Al-Daoud, E., Mahmod, R., Rushdan, M., & Kilicman, A. (2002). A new addition formula for elliptic curves over GF(2n). IEEE Transactions on Computers, 51(8), 972–975. https://doi.org/10.1109/TC.2002.1024743

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free