{'fraction_non_alphanumeric': 0.010043041606886656, 'fraction_numerical': 0.0, 'mean_word_length': 5.776699029126213, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A hybrid Firefly Algorithm using genetic operators for the cryptanalysis of a monoalphabetic substitution cipher

The monoalphabetic substitution cipher encrypts a given text by replacing every letter in the text with a different letter according to some predefined scheme. The cryptanalysis of this cipher involves the identification of this scheme using known language statistical data. The firefly algorithm (FA) is a metaheuristic algorithm, inspired by the flashing behavior of fireflies. This paper discusses the integration of the operators of mutation and crossover commonly used in Genetic Algorithms with the Firefly Algorithm for cryptanalysis of the monoalphabetic substitution cipher.