Parallel Scalar Multiplication on Elliptic Curves in Wireless Sensor Networks

Shou

et al. 2017

Int J Communication

Sensor devices are limited resource power and energy, thus providing security services for sensor networks is very difficult. Elliptic curve cryptography (ECC) is one of the most famous asymmetric cryptographic schemes, which offers the same level of security with much shorter keys compared to the other widely used asymmetric cryptographic algorithm, RSA (Rivest, Shamir, and Adleman). In ECC, the main and most-heavily used operation is the scalar multiplication kP, where the scalar value k is a private integer and must be secured. In this work, we present a new approach to accelerate the main scalar multiplication on ECC over prime fields for sensor networks. This approach uses an equivalent representation of points and can act as a support for existing schemes in a selected interval. The simulation results showed that the proposed technique increases the efficiency of the computation time. For example, on this scalar multiplication, we obtain a gain of 4 bits in 161 bits for 6.25% of the scalars. This gain can sometimes reach 100% in some cases. After this significant reduction of the scalar k, we present a fast precomputation algorithm in a distributed scalar multiplication on kP to avoid storage of precomputation points, which requires extra memory. KEYWORDS elliptic curve cryptography, fast scalar multiplication, precomputation point, wireless sensor networks Int J Commun Syst. 2017;30:e3327.wileyonlinelibrary.com/journal/dac

Section: Related Workmentioning

confidence: 99%

“…15,[18][19][20] Our goal is to avoid the storage of precomputation points. We first propose a scalar reduction technique to run fast computation of scalar multiplication.…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Accelerated precomputation points–based scalar reduction on elliptic curve cryptography for wireless sensor networks

Faye

Shou

et al. 2017

Int J Communication

“…In addition, sensor nodes might suffer external attacks during computation. In this paper we present our new fault tolerant parallel computing scheme for elliptic curve cryptography in wireless sensor networks, which is actually the following of our research published in [12].…”

Section: Introductionmentioning

confidence: 99%

A Fault Tolerant Parallel Computing Scheme of Scalar Multiplication for Wireless Sensor Networks

Shou

Distributed Computing and Networking

2014

Self Cite

In event-driven sensor networks, when a critical event occurs, sensors should transmit messages back to base station in a secure and reliable manner. We choose Elliptic Curve Cryptography to secure the network since it offers faster computation and good security with shorter keys. In order to minimize the running time, we propose to split and distribute the computation of scalar multiplications by involving neighboring nodes in this operation. In order to improve the reliability, we have also proposed a fault tolerance mechanism. It uses half of the available cluster members as backup nodes which take over the work of faulty nodes in case of system failure. Parallel computing does consume more resources, but the results of simulation show that the computation can be significantly accelerated. This method is designed specially for applications where running time is the most important factor.

Fast Scalar Multiplication on Elliptic Curve Cryptography in Selected Intervals Suitable for Wireless Sensor Networks

Faye

Cyberspace Safety and Security

Niang

et al. 2013

Self Cite

In Wireless Sensor Networks (WSNs), providing a robust security mechanism with limited energy resources is very challenging because of sensor node's limited resources (computation, bandwidth, memory). Asymmetric-key can fulfill the requirement, but if the number of nodes is large, symmetric-key cryptography is the best natural method because of its scalability. Asymmetric-key cryptography is power-hungry; nevertheless, Elliptic Curve Cryptosystems (ECC) are feasible and more flexible for sensor nodes. Scalar multiplication is the most widely used operation on ECC. Various methods for fast scalar multiplication exist, but they are based on the binary/ternary representation of the scalar. In this paper, we present a novel technique to make fast scalar multiplication on Elliptic Curve Cryptosystems over prime field for lightweight embedded devices like sensor nodes. Our method significantly reduces the computation of scalar multiplication by an equivalent representation of points based on point order in a given interval. Since our technique can act as a support for most existing methods, after an analytical and efficiency analysis, we implement and evaluate its performance in different scenari.