Decreasing point multiplication over ECC (Zp) using tree computations

A wireless network has a set of limitations such as low power consume, limited bandwidth, less memory space, less security access and architecture design issues. Considering these limitations, the best way of providing high security system for wireless network is to use Elliptic curve cryptography(ECC) which is one of the public key cryptography. The implementation of ECC has a set of point manipulation operations such as addition, subtraction, division, multiplication, inversion and doubling. In these operations, the point doubling is high time complexity which needs more clock cycles to compute its result. So it is necessary to reduce the time complexity of point doubling during processing. The proposed technique schedules coding for fast processing and reduces number of clock cycles during its atomic operations. It also reduces number of hazards and stalls during its processing. This is useful when it is implemented by using parallel processing.