A Fast Window-based Scalar Multiplication Algorithm for Elliptic Curve Cryptography in Wireless Sensor Networks

Abstract

In this paper, we propose an enhanced window-based mutual opposite form (EW-MOF) for scalar multiplication with ECC in WSNs. The proposed EW-MOF combines MOF with an enhanced window method that can reduce not only pre-computation time and memory usage, but also average key generation time that includes pre-computation time in each sensor node. Our analysis has shown that the proposed EW-MOF requires a smaller number of essential pre-computed points than the one's complement. Therefore, it is very suitable for WSNs. Simulation results show that the proposed EW-MOF is 24.69% faster than the one's complement method, which is the best method available, in the average key generation time of ECC that includes pre-computation time under different field sizes. In summary, the proposed EW-MOF is more feasible than the one's complement for wireless sensor networks in terms of key generation time and power saving.