Genetic algorithm cryptanalysis of a substitution permutation network

摘要

We provide a preliminary exploration of the use of genetic algorithms (GA) upon a substitution permutation network (SPN) cipher. The purpose of the exploration is to determine how to find weak keys. The size of the selected SPN created by Stinson gives a sample for showing the methodology and suitability of an attack using GA. We divide the types of keys into groups, each of which is analyzed to determine which groups are weaker. Simple genetic operators are examined to show the suitability of GA when applied to this problem. Results show the potential of GA to provide automated or computer assisted breaking of ciphers. The GA broke a subset of the keys using small input texts.