Key Exchange Based on Genetic Algorithm
Amanie Hasn Alhussain · Zenodo (CERN European Organization for Nuclear Research) · 2015
in this study, has shown how to design key exchange algorithm based on the features of crossover and mutation operations of genetic algorithm (GA) and asymmetric key encryption. The number of the crossover points together with number of mutation points dictate the length of the secret key and hence the strength of the algorithm. The algorithm is further strengthened by making it difficult to break by permuting the key by a random permutation factor; the randomness together with permutation makes the algorithm robust and hard to break. The proposed algorithm solves the problem of storing and distribution of the secret key over the network; the various examples and implementation of the algorithm proves that it exchanges the keys over the channel successfully.