DocumentCode
2929439
Title
Improvement of scalar multiplication time for elliptic curve cryptosystems
Author
Lehsaini, Mohamed ; Feham, Mohamed ; Hellel, Chifaa Tabet
Author_Institution
STIC Lab., Univ. of Tlemcen, Tlemcen, Algeria
fYear
2013
fDate
22-24 April 2013
Firstpage
53
Lastpage
57
Abstract
Sensor nodes have limited computing power and memory sizes. Sometimes, they are used in applications that require sending rapidly secure data to a remote control center. Therefore, they require lightweight techniques to accomplish this task. In this paper, we used Elliptical Curve Cryptography (ECC) for data encryption because ECC could create smaller and more efficient cryptographic keys compared to other cryptographic techniques such as RSA. We used specific algorithms to improve scalar multiplication time in spite of energy consumption. Moreover, we proposed a distributed scheme to enhance more the data delivery time from a source node to the base station by involving neighbors in the calculation. The results of experiments on TelosB motes showed considerable improvement of data delivery time.
Keywords
public key cryptography; wireless sensor networks; ECC; RSA; WSN; data delivery time; data encryption; distributed scheme; elliptic curve cryptosystems; energy consumption; scalar multiplication time; sensor nodes; wireless sensor networks; Elliptic curve cryptography; Elliptic curves; Encryption; Energy consumption; Wireless sensor networks; Data Delivery Time; Distributed Technique; ECC; Encryption; Energy Consumption; WSN; w-NAF;
fLanguage
English
Publisher
ieee
Conference_Titel
Programming and Systems (ISPS), 2013 11th International Symposium on
Conference_Location
Algiers
Print_ISBN
978-1-4799-1152-3
Type
conf
DOI
10.1109/ISPS.2013.6581494
Filename
6581494
Link To Document