Genetic algorithm cryptanalysis of the basic substitution permutation network.

Abstract

In this paper, a method to discover the key of a substitution permutation network (SPN) using genetic algorithms is described. A fitness measure based on the differential characteristics of the SPN is proposed and complete problem formulation is described. The complexity of the proposed attack is shown to be less than half of normal differential cryptanalysis of the same SPN.