Fast algorithm in ECC for wireless sensor network

Xu Huang, Pritam Shah, Dharmendra Sharma

Research output: A Conference proceeding or a Chapter in BookConference contribution

7 Citations (Scopus)

Abstract

Abstract—Elliptic curve cryptography (ECC) has been attractive to the people who are working in the field of the network security due to its 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). It is well known that scalar multiplication is the operation in elliptical curve cryptography which takes 80 % of key calculation time on wireless sensor network motes. In this paper, the 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. Index Terms—Elliptic curve cryptography, Scalar
Original languageEnglish
Title of host publicationA U M L A
Place of PublicationHong Kong, China
PublisherInternational Association of Engineers (IAENG)
Pages818-822
Number of pages5
Volume2
ISBN (Print)9789881821041
Publication statusPublished - 2010
EventInternational MultiConference of Engineers and Computer Scientists 2010 (IMECS 2010) - , Hong Kong
Duration: 17 Mar 201019 Mar 2010

Conference

ConferenceInternational MultiConference of Engineers and Computer Scientists 2010 (IMECS 2010)
CountryHong Kong
Period17/03/1019/03/10

Fingerprint

Cryptography
Wireless sensor networks
Network security
Computational efficiency

Cite this

Huang, X., Shah, P., & Sharma, D. (2010). Fast algorithm in ECC for wireless sensor network. In A U M L A (Vol. 2, pp. 818-822). Hong Kong, China: International Association of Engineers (IAENG).
Huang, Xu ; Shah, Pritam ; Sharma, Dharmendra. / Fast algorithm in ECC for wireless sensor network. A U M L A. Vol. 2 Hong Kong, China : International Association of Engineers (IAENG), 2010. pp. 818-822
@inproceedings{83a8856fe79841019079a05fdbbe9d0c,
title = "Fast algorithm in ECC for wireless sensor network",
abstract = "Abstract—Elliptic curve cryptography (ECC) has been attractive to the people who are working in the field of the network security due to its 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). It is well known that scalar multiplication is the operation in elliptical curve cryptography which takes 80 {\%} of key calculation time on wireless sensor network motes. In this paper, the 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. Index Terms—Elliptic curve cryptography, Scalar",
author = "Xu Huang and Pritam Shah and Dharmendra Sharma",
year = "2010",
language = "English",
isbn = "9789881821041",
volume = "2",
pages = "818--822",
booktitle = "A U M L A",
publisher = "International Association of Engineers (IAENG)",

}

Huang, X, Shah, P & Sharma, D 2010, Fast algorithm in ECC for wireless sensor network. in A U M L A. vol. 2, International Association of Engineers (IAENG), Hong Kong, China, pp. 818-822, International MultiConference of Engineers and Computer Scientists 2010 (IMECS 2010), Hong Kong, 17/03/10.

Fast algorithm in ECC for wireless sensor network. / Huang, Xu; Shah, Pritam; Sharma, Dharmendra.

A U M L A. Vol. 2 Hong Kong, China : International Association of Engineers (IAENG), 2010. p. 818-822.

Research output: A Conference proceeding or a Chapter in BookConference contribution

TY - GEN

T1 - Fast algorithm in ECC for wireless sensor network

AU - Huang, Xu

AU - Shah, Pritam

AU - Sharma, Dharmendra

PY - 2010

Y1 - 2010

N2 - Abstract—Elliptic curve cryptography (ECC) has been attractive to the people who are working in the field of the network security due to its 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). It is well known that scalar multiplication is the operation in elliptical curve cryptography which takes 80 % of key calculation time on wireless sensor network motes. In this paper, the 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. Index Terms—Elliptic curve cryptography, Scalar

AB - Abstract—Elliptic curve cryptography (ECC) has been attractive to the people who are working in the field of the network security due to its 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). It is well known that scalar multiplication is the operation in elliptical curve cryptography which takes 80 % of key calculation time on wireless sensor network motes. In this paper, the 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. Index Terms—Elliptic curve cryptography, Scalar

M3 - Conference contribution

SN - 9789881821041

VL - 2

SP - 818

EP - 822

BT - A U M L A

PB - International Association of Engineers (IAENG)

CY - Hong Kong, China

ER -

Huang X, Shah P, Sharma D. Fast algorithm in ECC for wireless sensor network. In A U M L A. Vol. 2. Hong Kong, China: International Association of Engineers (IAENG). 2010. p. 818-822