Sliding window method with flexible window size for scalar multiplication on wireless sensor network nodes.

Abstract

Abstract-Scalar multiplication is time consuming operation of ECC when implemented on wireless sensor nodes. The wireless sensor node consists of 8 bit micro controller and limited memory for the storage. The scalar multiplication process can be accelerated with the sliding window method which has two stages namely pre computation and an evaluation stage. Points for use in the evaluation stage are computed in the pre computation stage. The scalar multiplication is carried out in the evaluation stage with the addition of pre computed points. The number of pre computations depends on the window size of sliding window method. More is the window size, more are the pre computations and more is the memory required for the storage .This is the well-known draw-back of the sliding window method when implemented on WSN Nodes. This research paper proposes sliding window method with flexible window size for scalar multiplication on wireless sensor nodes. The flexible window size will prevent sensor node failures due to stack overflow.

A new approach to decrease the computational complexity of e‐voting protocols

“…One way to accelerate the protocol is to speed up the point multiplication, which in turn results in accelerating the cryptosystem, in particular the voting protocol. Some examples of this approach can be found in the literature . Also, Balasubramaniam and Karthikeyan provide a useful survey on the applied protocols.…”

“…This is why these protocols are not applicable in large scale in spite of the high level of their security. There is a variety of research to accelerate finding the answer . This also motivates us to suggest a solution to form a smaller table that needs fewer computational operations.…”

Software Implementation of Cyclic Abelian Elliptic Curve using Matlab

“…P.G. Shah, X. Huang and D. Sharma et al [11] have implemented ECC-based authentication algorithm in which they conclude that elliptic curve scalar multiplication is core operation, but this operation is the most time consuming operation. This operation takes 85% of executing time [11].…”

“…Shah, X. Huang and D. Sharma et al [11] have implemented ECC-based authentication algorithm in which they conclude that elliptic curve scalar multiplication is core operation, but this operation is the most time consuming operation. This operation takes 85% of executing time [11]. Abdalhossein Rezai and Parviz Keshavarzi et.al [10] have worked on the more efficient algorithm elliptic curve cryptosystem based on a novel finite field multiplication and a high performance scalar multiplication algorithm for wireless network authentication.…”

Suspicious Loitering Detection from Annotated CCTV Feed Using CEP Based Approach

“…Several ML detectors have been implemented in domains such as intrusion detection and fingerprint identification for interest event patterns identification from sensor data streams (Lee et al 1999). Shah et al (2010) implemented sliding window (SW) method with varying window size on wireless sensor nodes for scalar multiplication. This method can considerably reduce the node failure risk and at the same time promotes memory-saving.…”