IDEAS home Printed from
   My bibliography  Save this article

A novel cuckoo search strategy for automated cryptanalysis: a case study on the reduced complex knapsack cryptosystem


  • Ashish Jain

    () (Indian Institute of Technology (IIT) Indore)

  • Narendra S. Chaudhari

    () (Indian Institute of Technology (IIT) Indore
    Visvesvaraya National Institute of Technology (VNIT) Nagpur)


Abstract During the past decade several new variants of knapsack cryptosystems have been reported in the literature. Hence, there is a growing demand for automated cryptanalysis of knapsack cryptosystems. Brute force approach is capable to cryptanalyze simple stages of cryptosystems while cryptanalysis of complex cryptosystems demands efficient methods and high-speed computing systems. In the literature, several search heuristics have proven to be promising and effective in automated cryptanalysis (or attacks) of classical or reduced cryptosystems. This paper presents the automated cryptanalysis of the reduced multiplicative knapsack cryptosystem using three different search heuristics, namely, cuckoo search, particle swarm optimization and genetic algorithm. It should be noted that the considered cryptosystem is reduced but is complex and practical representative. To the best of our knowledge, this is the first time when the cuckoo search is utilized for automated cryptanalysis of the complex cryptosystem. The performance of developed techniques has been measured in terms of time taken by the algorithm (i.e., how efficient the algorithm is?), number of times the original plaintext is determined (i.e., success rate), and the number of candidate plaintexts is examined before determining the original plaintext (i.e., how effective the algorithm is?). For the case considered, performance of the proposed techniques, namely, novel binary cuckoo search (NBCS), improved genotype–phenotype binary particle swarm optimization (IGPBPSO), and new genetic algorithm (NGA) is as follows: roughly the NBCS technique is 12% and 8% more efficient, 6% and 5% more successful, and 16% and 12% more effective than IGPBPSO and NGA, respectively. This results show that the proposed NBCS strategy is superior to IGPBPSO and NGA, and therefore NBCS strategy can be used as an efficient and effective choice for solving similar binary discrete problems such as 0–1 knapsack problem, set covering problem, etc.

Suggested Citation

  • Ashish Jain & Narendra S. Chaudhari, 2018. "A novel cuckoo search strategy for automated cryptanalysis: a case study on the reduced complex knapsack cryptosystem," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(4), pages 942-961, August.
  • Handle: RePEc:spr:ijsaem:v:9:y:2018:i:4:d:10.1007_s13198-017-0690-9
    DOI: 10.1007/s13198-017-0690-9

    Download full text from publisher

    File URL:
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    As the access to this document is restricted, you may want to search for a different version of it.


    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:spr:ijsaem:v:9:y:2018:i:4:d:10.1007_s13198-017-0690-9. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.