Secure Wireless Sensor Networks with Dynamic Window for Elliptic Curve Cryptography

Xu Huang, Dharmendra Sharma, Mohammed Aseeri, Sultan Almorqi

Research output: A Conference proceeding or a Chapter in BookConference contributionpeer-review

6 Citations (Scopus)

Abstract

Elliptic curve cryptosystem (ECC) was proposed by Miller and Koblitz which relies on the difficulty of elliptic curve discrete logarithmic problem (ECDLP). It is gaining wide acceptance as an alternative to the conventional public key cryptosystem such as RSA, DSA, DH. The security of the WSN becomes one of the major concerns in its applications. It is well known that scalar multiplication operation in ECC accounts for about 80% of key calculation time on wireless sensor network motes. In this paper we present an optimized dynamic window based on our previous research works. The whole quality of service (QoS) has been improved under this algorism in particularly the power consuming is more efficiently. The simulation results showed that the average calculation time, due to fuzzy conditions decreased from previous 26 to current 9 as a whole the calculation time, decreased by approximately 18% in comparison to our previous algorithms in an ECC wireless sensor network
Original languageEnglish
Title of host publicationProceedings of Saudi International Electronic, Communications and Photonics Conference
EditorsAttieh A Al-Ghamdi
Place of PublicationUSA
PublisherIEEE, Institute of Electrical and Electronics Engineers
Pages1-5
Number of pages5
Volume1
ISBN (Print)9781457706775
DOIs
Publication statusPublished - 2011
EventElectronics, Communications and Photonics Conference (SIECPC), 2011 Saudi International - Riyadh, Riyadh, Saudi Arabia
Duration: 24 Apr 201126 Apr 2011

Conference

ConferenceElectronics, Communications and Photonics Conference (SIECPC), 2011 Saudi International
Country/TerritorySaudi Arabia
CityRiyadh
Period24/04/1126/04/11

Cite this