Cuckoo Search Strategies for Solving Combinatorial Problems (Solving Substitution Cipher: An Investigation)

Approximate algorithms have been well studied in order to solve combinatorial problems. This paper addresses cryptanalysis of the substitution cipher which is an interesting combinatorial problem. For this purpose, we utilize one of the latest approximate algorithms which is referred to as cuckoo search. Here, we point out that the proposed cuckoo search algorithm is not only an effective and efficient approach for solving the considered cryptanalysis problem, rather it can be a true and efficient choice for solving similar combinatorial problems.