International Journal of Computer Applications
The prevention of information from unauthorized access is the main concern in the area of cryptography. There are various algorithms i.e. Elgamal, RSA, diffie Hellman, Knapsack are proposed with varying key length and key management methods. The size of encrypted message, key management method and algorithm efficiency is critical in respect of implementation in organizations that store large volumes of data. This paper proposes the comparison among various algorithms for different cryptography algorithms used in generating the neighborhood keys.