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...
Saved in:
Published in | 2011 World Congress on Information and Communication Technologies pp. 202 - 206 |
---|---|
Main Authors | , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.12.2011
|
Subjects | |
Online Access | Get full text |
ISBN | 1467301272 9781467301275 |
DOI | 10.1109/WICT.2011.6141244 |
Cover
Summary: | 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. |
---|---|
ISBN: | 1467301272 9781467301275 |
DOI: | 10.1109/WICT.2011.6141244 |