DocumentCode
593287
Title
A complete, efficient and lightweight cryptography solution for resource contrainst Mobile Ad-Hoc Networks
Author
Kumar, Ajit ; Gopal, Kartik ; Aggarwal, A.
Author_Institution
Dept. of CSE/IT, Jaypee Inst. of Inf. Technol., Noida, India
fYear
2012
fDate
6-8 Dec. 2012
Firstpage
854
Lastpage
860
Abstract
This paper examines the lightweight cryptography primitives and proposes a novel integration mechanism of primitives to provide complete cryptography services for resource constraint Mobile Ad-Hoc Networks (MANETs). In this work, Tseng´s protocol is modified to integrate primitives [30]. In order to evaluate the performance of secure MANETs, software; throughput, jitter & end to end delay; and hardware parameters; area consumption in terms of gate equivalents (GE); are taken into consideration. An integration proposal of these cryptography primitives has been proposed and it has been observed that these primitives can be clubbed with hardware cost of 36.5% of the total GE with maximum through and minimum delay using Destination Sequenced Distance Vector (DSDV) protocol.
Keywords
cryptographic protocols; mobile ad hoc networks; DSDV protocol; GE; MANET; Tseng protocol; area consumption; destination sequenced distance vector; end to end delay; gate equivalent; hardware parameters; jitter; lightweight cryptography primitive; resource constraint mobile ad-hoc network; Ad hoc networks; Delay; Encryption; Logic gates; Mobile computing; Authentication; Confidentiality; Cryptography; Gate Equivalents; Hashing; Key Management; Lightweight;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Distributed and Grid Computing (PDGC), 2012 2nd IEEE International Conference on
Conference_Location
Solan
Print_ISBN
978-1-4673-2922-4
Type
conf
DOI
10.1109/PDGC.2012.6449935
Filename
6449935
Link To Document