IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v10y2019i2p109-130.html
   My bibliography  Save this article

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

Author

Listed:
  • Ashish Jain

    (Indian Institute of Technology Indore, Indore, India & Manipal University Jaipur, Jaipur, India)

  • Narendra S. Chaudhari

    (Indian Institute of Technology Indore, Indore, India)

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.

Suggested Citation

  • Ashish Jain & Narendra S. Chaudhari, 2019. "An Improved Genetic Algorithm and A New Discrete Cuckoo Algorithm for Solving the Classical Substitution Cipher," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 10(2), pages 109-130, April.
    • Handle: RePEc:igg:jamc00:v:10:y:2019:i:2:p:109-130
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.2019040105
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jamc00:v:10:y:2019:i:2:p:109-130. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.