• Jan 05, 2017 News![CFP] 2017 the annual meeting of IJFCC Editorial Board, ICCTD 2017, will be held in Paris, France during March 20-22, 2017.   [Click]
  • Mar 24, 2016 News! IJFCC Vol. 4, No. 4 has been indexed by EI (Inspec).   [Click]
  • Mar 24, 2017 News!Vol.6, No.1 has been published with online version.   [Click]
General Information
    • ISSN: 2010-3751
    • Frequency: Bimonthly (2012-2016); Quarterly (Since 2017)
    • DOI: 10.18178/IJFCC
    • Editor-in-Chief: Prof. Mohamed Othman
    • Executive Editor: Ms. Nancy Y. Liu
    • Abstracting/ Indexing: Google Scholar, Engineering & Technology Digital Library, and Crossref, DOAJ, Electronic Journals LibraryEI (INSPEC, IET).
    • E-mail:  ijfcc@ejournal.net 
Editor-in-chief
Prof. Mohamed Othman
Department of Communication Technology and Network Universiti Putra Malaysia, Malaysia
It is my honor to be the editor-in-chief of IJFCC. The journal publishes good papers in the field of future computer and communication. Hopefully, IJFCC will become a recognized journal among the readers in the filed of future computer and communication.
IJFCC 2014Vol.3(6): 395-399 ISSN: 2010-3751
DOI: 10.7763/IJFCC.2014.V3.335

A Powerful Genetic Algorithm to Crack a Transposition Cipher

Omar Alkathiry and Ahmad Al-Mogren
Abstract—Security of information systems depends heavily on the strength of the cryptosystem. Throughout the years, several cryptosystem algorithms have been developed. These algorithms may inherit some weakness that can jeopardize the integrity of the data. In this paper, we present a genetic algorithm to crack a transposition cipher that extends on the notable research in the field and introduces new ideas including a novel crossover function, a dictionary of the most used words in the English language to evaluate the fitness of the keys in any generation, a dynamic selection method, and a variable generating number. This algorithm starts with a very small randomly selected set of keys, and proceeds the crossover operation on the highly fit keys to produce next generations until a specific number of generations, the final result produces a key that is either a perfect match to the original encryption key or one that is very close. Our experiments and results show mostly optimal solutions for the keys in linear time performance which is a dramatic improvement to the brute force algorithm that takes a factorial time to crack the key.

Index Terms—Cipher key, cryptanalysis, dictionary matching, genetic algorithm, transposition cipher.

Omar Alkathiry is with King Saud University, Riyadh, Saudi Arabia (e-mail: omar.alkathiry@gmail.com).
Ahmad Al-Mogren is with College of Computer and Information Sciences, King Saud University, Riyadh, Saudi Arabia (e-mail: ahalmogren@ksu.edu.sa).

[PDF]

Cite: Omar Alkathiry and Ahmad Al-Mogren, "A Powerful Genetic Algorithm to Crack a Transposition Cipher," International Journal of Future Computer and Communication vol. 3, no. 6, pp. 395-399, 2014.

Copyright © 2008-2016. International Journal of Future Computer and Communication. All rights reserved.
E-mail: ijfcc@ejournal.net