Cryptanalysis of Simplified-AES Encrypted Communication
R. Vimalathithan, Daniele Rossi, M. Omaña, C. Metra, Muniyappan Lakshapalam Valarmathi · Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna) · 2015
Genetic algorithm based Cryptanalysis has gained considerable attention due to its fast convergence time. This paper proposes a Genetic Algorithm (GA) based cryptanalysis scheme for breaking the key employed in Simplified- AES. Our proposed GA allows us to break the key using a Known Plaintext attack requiring a lower number of Plaintext-Ciphertext pairs compared to existing solutions. Moreover, our approach allows us to break the S-AES key using also a Ciphertext-only attack. As far as we are concerned, it is the first time that GAs are used to perform this kind of attack on S-AES. Experimental results prove that our proposed fitness function along with GA have drastically reduced the search space by a factor of 10 in case of Known plain text and 1.8 in case of Ciphertext only attack.