Abstract
Several Genetic Algorithms have been developed for applications of cryptography problem; the primary distinction among all of them being the G.A. used for decryption problem and obtains the plain text. In this paper a new approach is proposed using Genetic Algorithm with cryptography. G.A. is used to obtain a best secret key in polyalphabetic substitution cipher. This key will be used then for encryption and decryption with a high level of security. The program is written in Matlab language (6.5).
Highlights
Many problems that computer scientists encounter are very hard to solve
While no efficient process is known for generating an optimal solution all of the time to an NP-hard problem, many NP-hard problems can be solved efficiently much of the time to near optimality using a heuristic
Dimovski A., Gligoroski D.(4) in their paper presented three optimization heuristics which can be utilized in attacks on the transposition cipher, These heuristics are simulated annealing, genetic algorithm and tabu search
Summary
Many problems that computer scientists encounter are very hard to solve Some of these problems commonly called NP-hard problems, have no known efficient solution process (i.e., no algorithm that returns a solution in a time that is polynomial with respect to the size of the input). While no efficient process is known for generating an optimal solution all of the time to an NP-hard problem, many NP-hard problems can be solved efficiently much of the time to near optimality using a heuristic. Spillman R., Janssen M., Nelson B., and Kepner M.,(13) consider a new approach to cryptanalysts based on the application of a genetic algorithm. They showed that such an algorithm could be used to discover the key for a simple substitution cipher. In this paper our goal of using G.A. with encryption is to generate the best secret key for Monoalphabetic Substitution Cipher which satisfied a high level of security
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
