Back to Search Start Over

An Improved Genetic Algorithm and A New Discrete Cuckoo Algorithm for Solving the Classical Substitution Cipher

Authors :
Ashish Jain
Narendra S. Chaudhari
Source :
International Journal of Applied Metaheuristic Computing. 10:109-130
Publication Year :
2019
Publisher :
IGI Global, 2019.

Abstract

Searching secret key of classical ciphers in the keyspace is a challenging NP-complete problem that can be successfully solved using metaheuristic techniques. This article proposes two metaheuristic techniques: improved genetic algorithm (IGA) and a new discrete cuckoo search (CS) algorithm for solving a classical substitution cipher. The efficiency and effectiveness of the proposed techniques are compared to the existing tabu search (TS) and genetic algorithm (GA) techniques using three criteria: (a) average number of key elements correctly detected, (b) average number of keys examined before determining the required key, and (c) the mean performance time. As per the results obtained, the improved GA is comparatively better than the existing GA for criteria (a) and (c), while the proposed CS strategy is significantly better than rest of the algorithms (i.e., GA, IGA, and TS) for all three criteria. The obtained results indicate that the proposed CS technique can be an efficient and effective option for solving other similar NP-complete combinatorial problems also.

Details

ISSN :
19478291 and 19478283
Volume :
10
Database :
OpenAIRE
Journal :
International Journal of Applied Metaheuristic Computing
Accession number :
edsair.doi...........3c2e30a162bc5beb3f83b5460c03a96f
Full Text :
https://doi.org/10.4018/ijamc.2019040105