The Firefly Algorithm and Application in Cryptanalysis of Monoalphabetic Substitution Ciphers

American Journal of Computer Science and Engineering Survey (AJCSES) is a peer review open access journal publishing the research in computer science and engineering survey.

American Journal of Computer Science and Engineering Survey (AJCSES) is devoted to the publication referred papers on cutting-edge research in all the scientific areas of Computer Engineering and novel insights into its technology.  Journal intends to provide its researchers, practitioners and academics the latest and remarkable researches made by different scientists and industrial experts by providing free access to the published articles.

In the context of combinatorial optimization (CO), algorithms can be classified as either complete or approximate algorithms. Complete algorithms are guaranteed to find for every finite size instance of a CO problem an optimal solution in bounded time. Yet, for CO problems that are NP-hard, no polynomial time algorithm exists, assuming that P! = NP2. Cryptology is the branch of science that deals with the study of methods for encryption and decryption of data, and is commonly employed in the transmission of secure data. Cryptology can be divided into two branches: cryptography and cryptanalysis. Cryptography deals with the creation of new and powerful schemes for the encryption of data. Cryptanalysis deals with the study of breaking these schemes of encryption by identifying possible flaws or vulnerabilities5. In this paper we use Firefly Metaheuristic algorithm. Firefly Algorithm (FA)1,6,8 developed by Xin-She Yang at Cambridge University in 2007. FA is an optimization algorithm inspired by behaviour and motion of fireflies. In this paper we present new algorithm for cryptanalysis of the mono alphabetic substitution cipher by using firefly algorithm. English language statistical data has been used to assign fitness values to potential solutions. Such algorithm is expected to work best for large input cipher text lengths

The firefly algorithm (FA) is Nature Inspired Algorithm; this algorithm is based on flashing behaviour of fireflies. The Monoalphabetic substitution cipher creates cipher text by replacing each alphabet with another alphabet. The cryptanalysis of substitution cipher involves statistical data of language. In this paper we proposed new Firefly Algorithm for cryptanalysis of the Monoalphabetic substitution cipher and then compared result with random algorithm on the basis of convergence time and corrected percentage of decrypted text.

American Journal of Computer Science and Engineering Survey announces papers for the upcoming issue release.  Interested can submit your manuscripts as an e-mail attachment to the Editorial Office at computereng@imedpub.org

Media contact:

Maegan Smith

Managing Editor

American Journal of Computer Science and Engineering Survey (IPACSES)

Mail ID: computersci@scholarlymed.com

WhatsApp no: + 1-504-608-2390