Selective Encryption Algorithm for Messages in Wireless Ad-hoc Network

Security is one of the most challenging aspects in internet and network applications domain. In this domain the major issue is to provide security to the data which is travelling on the communication link. Data encryption is the primary solution to protect the data confidentiality and integrity between any pair of node. Using symmetric key algorithms fast and efficient cryptosystems can be built as they have significant applications. For a wireless ad-hoc network with constraint computational resources, the cryptosystem based on symmetric key algorithms is extremely suitable for such an agile and dynamic environment along with other security strategies. The selective encryption algorithms are preferred by wireless networks because they are energy efficient for wireless devices. The probabilistic and the proposed algorithms enable a sender to include proper uncertainty in the process of message encryption so that only entrusted receiver can decrypt the cipher text and other unauthorized nodes have no knowledge of the transmitted messages on the whole.

Autorentext

Ganesh Patil has completed his Ph.D from Martin Luther University, Halle, Germany. His expertise lies in the area of recombinant protein cloning, expression, purification, characterization. He is specialized in the area of process development on production of recombinant proteins, bacterial and viral antigens and monoclonal antibodies.