Key Management Using Particle Swarm Optimization in MANET

With the accretion in the demand for robustness in the cryptographic algorithms, we are compelled to find a practical answer to this desire of reliable and dynamic mode of communication. Though many of the cryptographic devices possess mobility and hence are engaged within a mobile ad hoc network (MANET), yet the security goals still remain the same, viz. availability, integrity, confidentiality, non-repudiation, and authenticity. This work is an attempt to devise a secured and authenticated procedure for key management employing asymmetric cryptography. The following procedure would be employed in MANETs. This project is an amalgamation of the two most researched topics in the current cyber world. The approach presented here is an attempt where we exploit the randomness associated with the crossover and mutation process of the genetic algorithm; moreover, to make it unbreachable, a scheduled random factor is included which is derived using the particle swarm optimization. At last, the scheme is implemented in Python 3 and implemented for encrypting a plaintext document into ciphertext and decrypting the ciphertext into the respective plaintext. Furthermore, the algorithm devised here is common and can be further implemented for any secured transmission of data.