ED25519 : a new secure compatible elliptic curve for mobile wireless network security

Abstract EN

Wireless Sensor Networks (WSNs) create various security threats, such as application variance in different sectors along with the model of cryptographic primitivity and necessity.

Despite modernistic evolution, the skillful utilization of Elliptic Curve Cryptography (ECC) for WSNs is a very progressive investigation topic and approaches to reduce the time and intensity cost.

Security of ECC commits on the hardness of the Elliptic Curve Discrete Logarithm Problem.

Many elliptic curve standards are available, such as ANSI X9.62, NIST FIPS 186-2 …etc.

Due to some drawbacks in NIST curves associated with security matters, it is important to investigate for secure alternatives.

In our work, we will select ??25519 (Edwards curve) at the 128-bit security level and contrast it with Weierstraß curve (also known as Weierstrass curve).

To complete the field-calculation functions, we utilize a radix-24 , which illustrates the operands with MoTE-ECC for Memsic’s MICAz motes over Optimal Prime Fields (OPFs) of variable size; e.g.

160, 192, 224 and 225 bits.

We take ECDH (Elliptic-curve Diffie–Hellman) key interchange among two nodes where every node needs two scalar multiplications to execute.

The scalar multiplication over twisted Edwards curve utilizes a comb technique to establish base point and utilizes extended projective coordinates for point summation.

Our implementation shows that an ECDH takes 18.20 mJ energy consumption over 160-bit OPF, which is performing better than AVR-based sensor node.

The advantages of our proposed method will grant advance security and power consumption and diminish communication burden through key management.