There are several techniques for projective coordinate that can be used for speeding up the computation kP over GF (2n). In this paper we overview all this techniques method in projective coordinate and introduce a new efficient formula in projective coordinates. This formula used the idea of reducing the number of underlying field multiplication. Elliptic curve protocols and applications can be implemented with better performance using the suggested formula.
Keywords: Elliptic Curves over GF (2n), Projective Coordinate, Cryptography.
Corresponding author: E-mail: Iqbal501@yahoo.com
Jebril, I. H. ., Salleh, R. ., & M., A. . (2018). Overview of Addition Formulas for Elliptic Curves Over GF (2n) In Cryptography. CURRENT APPLIED SCIENCE AND TECHNOLOGY, 52-61.
