The genetic algorithms are a well-known family of high-performance probabilistic algorithms. In this paper, we explore the possibility of using the genetic algorithm for the Knapsack problem to compromise the security of a Knapsack cipher. Despite being much faster than the exact algorithms, the...

Combinatorial optimization problems are usually NP-hard and the solution space of them is very large. Therefore the set of feasible solutions cannot be evaluated one by one. Artificial Bee Colony (ABC), Particle Swarm Optimization (PSO) and Genetic Algorithms (GA) are metaheuristic techniques...