“…Fordeterminingsecretkey,theautomatedattackstrategymayusejusttheknownciphertexts (i.e.,encryptedplaintexts),someplaintexts,andintelligentalgorithms.Iftheattacker(orcryptanalyst) recoverthesecretkeybyusingthe"knownciphertexts"only,thenthiskindofattackisreferredas aciphertext-onlyattack (Menezesetal.,1996;Stinson,2005;Holden,2017).Thistypeofattack is most demanding and challenging, therefore, in this work, we demonstrate such attacks using metaheuristic techniques. For a systematic demonstration of automated attacks, the well-known classicalsubstitutioncipherisconsidered.Onecanaskwhymodernciphersarenotconsideredto demonstratemetaheuristicattacks.Thefactisthatmetaheuristicscannotbeappliedtoattackmodern ciphers such as DES (data encryption standard), AES (advanced encryption standard), and RSA (Rivest-Shamir-Adleman),becauseunsuitabilityindesigningthefitnessfunctionformodernciphers (Castro and Viñuela, 2005;Danziger and Henriques, 2012;Awad and El-Alfy, 2015). However, cryptanalysisofclassicalciphers(anNP-completeproblem)canbecarriedoutusingmetaheuristics becausethefitnessfunctioncanbewell-designedbyusingexpectedandobservedn-gramstatistics ofthelanguage (CastroandViñuela,2005;DanzigerandHenriques,2012;AwadandEl-Alfy,2015).…”