Algorithm based on one's complement for fast scalar multiplication in ECC for wireless sensor network

Pritam Gajkumar Shah, Xu Huang, Dharmendra Sharma

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

11 Citations (Scopus)

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 key calculation time to meet the potential applications in particular for wireless sensor networks. 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.

Original languageEnglish
Title of host publication24th IEEE International Conference on Advanced Information Networking and Applications Workshops, WAINA 2010
Place of PublicationDanvers, USA
PublisherIEEE, Institute of Electrical and Electronics Engineers
Pages571-576
Number of pages6
ISBN (Print)9780769540191
DOIs
Publication statusPublished - 2010
Event24th IEEE International Conference on Advanced Information Networking and Applications Workshops, WAINA 2010 - Perth, Australia
Duration: 20 Apr 201023 Apr 2010

Conference

Conference24th IEEE International Conference on Advanced Information Networking and Applications Workshops, WAINA 2010
CountryAustralia
CityPerth
Period20/04/1023/04/10

Fingerprint

Cryptography
Wireless sensor networks
Network security
Computational efficiency

Cite this

Shah, P. G., Huang, X., & Sharma, D. (2010). Algorithm based on one's complement for fast scalar multiplication in ECC for wireless sensor network. In 24th IEEE International Conference on Advanced Information Networking and Applications Workshops, WAINA 2010 (pp. 571-576). Danvers, USA: IEEE, Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/WAINA.2010.48
Shah, Pritam Gajkumar ; Huang, Xu ; Sharma, Dharmendra. / Algorithm based on one's complement for fast scalar multiplication in ECC for wireless sensor network. 24th IEEE International Conference on Advanced Information Networking and Applications Workshops, WAINA 2010. Danvers, USA : IEEE, Institute of Electrical and Electronics Engineers, 2010. pp. 571-576
@inproceedings{15d5e40457974b72b1537e870c26ee16,
title = "Algorithm based on one's complement for fast scalar multiplication in ECC for wireless sensor network",
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 key calculation time to meet the potential applications in particular for wireless sensor networks. 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, Hamming weight, Nonadjacent form, One's complement subtraction, ROM, Scalar multiplication, Wireless sensor networks",
author = "Shah, {Pritam Gajkumar} and Xu Huang and Dharmendra Sharma",
year = "2010",
doi = "10.1109/WAINA.2010.48",
language = "English",
isbn = "9780769540191",
pages = "571--576",
booktitle = "24th IEEE International Conference on Advanced Information Networking and Applications Workshops, WAINA 2010",
publisher = "IEEE, Institute of Electrical and Electronics Engineers",
address = "United States",

}

Shah, PG, Huang, X & Sharma, D 2010, Algorithm based on one's complement for fast scalar multiplication in ECC for wireless sensor network. in 24th IEEE International Conference on Advanced Information Networking and Applications Workshops, WAINA 2010. IEEE, Institute of Electrical and Electronics Engineers, Danvers, USA, pp. 571-576, 24th IEEE International Conference on Advanced Information Networking and Applications Workshops, WAINA 2010, Perth, Australia, 20/04/10. https://doi.org/10.1109/WAINA.2010.48

Algorithm based on one's complement for fast scalar multiplication in ECC for wireless sensor network. / Shah, Pritam Gajkumar; Huang, Xu; Sharma, Dharmendra.

24th IEEE International Conference on Advanced Information Networking and Applications Workshops, WAINA 2010. Danvers, USA : IEEE, Institute of Electrical and Electronics Engineers, 2010. p. 571-576.

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

TY - GEN

T1 - Algorithm based on one's complement for fast scalar multiplication in ECC for wireless sensor network

AU - Shah, Pritam Gajkumar

AU - Huang, Xu

AU - Sharma, Dharmendra

PY - 2010

Y1 - 2010

N2 - 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 key calculation time to meet the potential applications in particular for wireless sensor networks. 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.

AB - 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 key calculation time to meet the potential applications in particular for wireless sensor networks. 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.

KW - Elliptic curve cryptography

KW - Hamming weight

KW - Nonadjacent form

KW - One's complement subtraction

KW - ROM

KW - Scalar multiplication

KW - Wireless sensor networks

UR - http://www.scopus.com/inward/record.url?scp=77954804191&partnerID=8YFLogxK

U2 - 10.1109/WAINA.2010.48

DO - 10.1109/WAINA.2010.48

M3 - Conference contribution

SN - 9780769540191

SP - 571

EP - 576

BT - 24th IEEE International Conference on Advanced Information Networking and Applications Workshops, WAINA 2010

PB - IEEE, Institute of Electrical and Electronics Engineers

CY - Danvers, USA

ER -

Shah PG, Huang X, Sharma D. Algorithm based on one's complement for fast scalar multiplication in ECC for wireless sensor network. In 24th IEEE International Conference on Advanced Information Networking and Applications Workshops, WAINA 2010. Danvers, USA: IEEE, Institute of Electrical and Electronics Engineers. 2010. p. 571-576 https://doi.org/10.1109/WAINA.2010.48