Algorithm Based on One's Complement for Fast Scalar Multiplication in ECC for Wireless Sensor Network

Algorithm Based on One's Complement for Fast Scalar Multiplication in ECC for Wireless Sensor Network

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 mult...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Shah, Pritam Gajkumar, Xu Huang, Sharma, Dharmendra
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Base stations
Conferences
Elliptic curve cryptography
Equations
Hamming weight
Information security
Mechanical sensors
Microcontrollers
Non-adjacent form
one's complement subtraction
ROM
Scalar multiplication
Very large scale integration
Wireless sensor networks
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
DOI:10.1109/WAINA.2010.48