In ECC encryption, encryption and decryption are performed using an arithmetic mechanism with an elliptic curve function. This mechanism is based on point multiplication performed by repeated point addition and point doubling. The proposed alternative efficient method for point multiplication is binary form or Non-Adjacent Form (NAF). The computational performance with preprocessed NAF form in on-the-fly operation ensures optimization over the binary form of scalar multiplication. In NAF encoding, each bit of a binary number is converted in turn, starting with the Least Significant Bit( LSB) and ending with the Most Significant Bit( MSB).