cryptanalysis of four-rounded des using binary particle swarm optimization
A highly efficient Binary PSO based cryptanalysis approach for four-rounded DES is presented. Several optimum keys are generated in different runs of the algorithm on the basis of their fitness value and finally, the real key is found by guessing every individual bit. The robustness of the proposed technique is also checked for eight-rounded DES. Our proposed approach has shown promising results over cryptanalysis of DES performed using other methods such as Genetic Algorithm.
cryptanalysis des pso ga fitness function