Abstract
A Binomial Crossover Based Artificial Bee Colony Algorithm for Cryptanalysis of Polyalphabetic Cipher
Highlights
Secure communication ensures unauthorised individuals not to be able to gain access to private data
Symmetric cryptosystems may be divided into two subgroups as monoalphabetic in which each character is substituted for another with a fixed substitution of another alphabet letter [2] and polyalphabetic cryptosystems in which an alphabet letter can be replaced without a fixed structure to a different letter depending on its plaintext position [3].The possible set of keys being the set of all potential alphabet permutations in the space of 26 letters by Monoalphabetic Substitution Ciphers equals more than 403 septillions which takes 12 trillion years to check all potential keys at a rate of a million keys per second [4]
Weber and Neri [33] compared the binomial crossover used in the DE with a variant binomial crossover, the results showed that this variant of the binomial crossover increases significantly the execution speed of the DE, especially in higher dimension problems
Summary
Secure communication ensures unauthorised individuals not to be able to gain access to private data This security is delivered through cryptography which generates an encrypted form of a given text with a key and facilitates confidentiality, message availability and integrity. Symmetric cryptosystems may be divided into two subgroups as monoalphabetic in which each character is substituted for another with a fixed substitution of another alphabet letter [2] and polyalphabetic cryptosystems in which an alphabet letter can be replaced without a fixed structure to a different letter depending on its plaintext position [3].The possible set of keys being the set of all potential alphabet permutations in the space of 26 letters by Monoalphabetic Substitution Ciphers equals more than 403 septillions which takes 12 trillion years to check all potential keys at a rate of a million keys per second [4].
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
