A complete, efficient and lightweight cryptography solution for resource contrainst Mobile Ad-Hoc Networks
Adarsh Kumar, Krishna Gopal, Alok Aggarwal · 2012
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.