A distributed method of key issue and revocation of mobile ad hoc networks using curve fitting

The Mobile Adhoc NETworks (MANETs) are vulnerable to routing attacks [4] and hackers scythe the wireless networks easily. The MANETs need a distinctive attention of confidentiality [5] and authentication since these networks have unstable topologies and uncertainty in routing. Generally, the hackers try to snoop the wireless medium and get information about the wireless networks, the nodes which are in a particular propagation range can do this easily. So, it is a best practice to encrypt all routing and payloads in MANETs to avoid all men in the middle attacks. The symmetric encryptions are the standards for encrypting long messages with the limited computational efforts but they need a common key to start the encryption and decryption process. There are two basic questions, How to exchange the key between the source and destination, moreover who will take care of issuing and revoking keys to the new entrants. The key management is an important aspect of security algorithms and the proposed work implements a standard key management system by using the curve fitting-least square method of polynomial interpolation.