Abstract Views :160 |
PDF Views:2
Authors
Affiliations
1 Department of CSE & IT at Kuppam Engineering College, Kuppam, A.P., IN
Source
Wireless Communication, Vol 2, No 2 (2010), Pagination: 47-51
Abstract
Elliptic curve cryptography (ECC) is having good potential for wireless sensor network security due to its smaller key size and its high strength of security. But there is a room to reduce the key calculation time to meet the potential applications, in particular for wireless sensor networks (WSN). Scalar multiplication is the operation in elliptical curve cryptography which takes 80% of key calculation time on wireless sensor network motes. This research proposes algorithm based on 1’s complement subtraction to represent scalar in scalar multiplication which offer less Hamming weight and will remarkably improve the computational efficiency of scalar multiplication.
Keywords
Elliptic Curve Cryptography, Scalar Multiplication, Non-Adjacent Form, Hamming Weight, One’s Complement Subtraction, Rom, Wireless Sensor Networks.
