Title :
Algorithm Based on One´s Complement for Fast Scalar Multiplication in ECC for Wireless Sensor Network
Author :
Shah, Pritam Gajkumar ; Huang, Xu ; Sharma, Dharmendra
Author_Institution :
Fac. of Inf. Sci. & Eng., Univ. of Canberra, Canberra, ACT, Australia
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 :
linear algebra; public key cryptography; wireless sensor networks; elliptic curve cryptography; fast scalar multiplication; hamming weight; wireless sensor network security; Base stations; Conferences; Elliptic curve cryptography; Equations; Hamming weight; Information security; Mechanical sensors; Microcontrollers; Very large scale integration; Wireless sensor networks; Elliptic curve cryptography; Hamming weight; Non-adjacent form; ROM; Scalar multiplication; one´s complement subtraction; wireless sensor networks;
Conference_Titel :
Advanced Information Networking and Applications Workshops (WAINA), 2010 IEEE 24th International Conference on
Conference_Location :
Perth, WA
Print_ISBN :
978-1-4244-6701-3
DOI :
10.1109/WAINA.2010.48
