An efficient implementation of elliptic curve over finite fields
M. Prabu, R. Shanmugalakshmi · 2010
The goal of this paper is to develop a basis acquaintance for finite fields and their operations and its mathematical views are used for finite field implementation. It shows an overview of a finite field and implemented the curve on different affine coordinate systems. In Elliptic Curve Cryptosystem, every curve point is purely based on prime field GF(p) and binary field GF(2m). Further more, our implementation is based on geometric and algebraic approach, which is under the finite fields.