An efficient scalar multiplication algorithm for ECC in WSNs

Author

Kodali, Ravi Kishore

Author_Institution

Dept. of Electron. & Commun. Eng., Nat. Inst. of Technol., Warangal, Warangal, India

fYear

2014

fDate

10-11 July 2014

Firstpage

229

Lastpage

233

Abstract

Wireless sensor networks (WSNs) facilitate real time monitoring in many commercial and military surveillance applications. These applications automatically call for a high level of security in such networks. Public key cryptographic (PKC) techniques such as Elliptic Curve Cryptography (ECC) provide a flexible interface to ensure security, requiring no pre-distribution of keys. However, ECC is very compute-intensive, owing to the computationally complex elliptic curve point multiplication operation. This work presents a technique to speed up the elliptic curve point multiplication operation, achieving a cost reduction of about 48% over the double and add algorithm and about 40% over the width-w Non Adjacent Form (NAF) algorithm. Additionally, results of its software implementation are presented.

Keywords

military communication; public key cryptography; real-time systems; wireless sensor networks; ECC; NAF; WSN; commercial surveillance; complex elliptic curve point multiplication operation; cost reduction; elliptic curve cryptography; military surveillance; public key cryptographic techniques; real time monitoring; scalar multiplication; width-w nonadjacent form; wireless sensor networks; Algorithm design and analysis; Elliptic curve cryptography; Elliptic curves; Jacobian matrices; Software algorithms; Wireless sensor networks; ECC; Non-Adjacent Form; Point Multiplication; WSN;

fLanguage

English

Publisher

ieee

Conference_Titel

Control, Instrumentation, Communication and Computational Technologies (ICCICCT), 2014 International Conference on

Conference_Location

Kanyakumari

Print_ISBN

978-1-4799-4191-9

Type

conf

DOI

10.1109/ICCICCT.2014.6992961

Filename

6992961