Abstract

Adhoc network is very popular due to their infrastructure less architecture. One main challenge in such networks is to provide security in communication where the hosts rely on each other to keep the network connected. This types of network suffers in passive eavesdropping, impersonation, replay attacks. To resist this type of attack we use secret sharing techniques based on CRT. In this paper we have proposed a two level key distribution scheme for adhoc networks. In the first level we use Knapsack algorithm for key distribution among the cluster heads and in the second level we use Chinese remainder theorem(CRT) to share the secret among the nodes of the cluster.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call