Cryptanalysis of Mono-Alphabetic Substitution Ciphers using Genetic Algorithms and Simulated Annealing

Shalini Jain; Nalin Chhibber; Sweta Kandi

doi:10.51611/iars.irj.v8i1.2018.84

Authors

Shalini Jain Marathwada Institute of Technology, Dr. Babasaheb Ambedkar Marathwada University, India
Nalin Chhibber University of Waterloo, Ontario, Canada
Sweta Kandi Marathwada Institute of Technology, Dr. Babasaheb Ambedkar Marathwada University, India

DOI:

https://doi.org/10.51611/iars.irj.v8i1.2018.84

Keywords:

Cryptanalysis, Mono-Alphabetic Substitution Cipher, Genetic Algorithms, Simulated Annealing

Abstract

In this paper, we intend to apply the principles of genetic algorithms along with simulated annealing to cryptanalyze a mono-alphabetic substitution cipher. The type of attack used for cryptanalysis is a ciphertext-only attack in which we donâ€™t know any plaintext. In genetic algorithms and simulated annealing, for ciphertext-only attack, we need to have the solution space or any method to match the decrypted text to the language text. However, the challenge is to implement the project while maintaining computational efficiency and a high degree of security. We carry out three attacks, the first of which uses genetic algorithms alone, the second which uses simulated annealing alone and the third which uses a combination of genetic algorithms and simulated annealing.

Downloads

Download data is not yet available.

References

M. Ralph and W. Ralph, â€œA Word-Based Genetic Algorithm for Cryptanalysis of Short Cryptogramsâ€, American Association for Artificial Intelligence pp.229- 233, 2009.
D. Bethany, â€œGenetic Algorithm in Cryptographyâ€, Rochester Institute of Technology, Rochester, New York, July 2010.
W. R. Grundlingh and Jan Van Vuuren, â€œUsing Genetic Algorithms to break a simple Cryptographic Cipherâ€, March 31, 2005.
O. David, â€œEvolutionary Algorithm for Decryption of Mono-alphabetic Homophonic Substitution Ciphers Encoded as Constraint Satisfaction Problemsâ€, Atlanta, Georgia, USA, 2008.
R. Spillman, M. Janssen, B. Nelson, and M. Kepner, â€œUse of a genetic algorithm in the of simple substitution ciphersâ€, Cryptologia 17(1), pp.31 - 44, January 2003.
A. J. Clark, Optimization Heuristics for Cryptology, PhD, Thesis, Queensland University of Technology, February 2012.
L. C. Washington, Introduction to cryptography with coding theory, Pearson Education, Inc., 2nd edition, 2006.
A. K. Verma, Mayank Dave and, R. C. Joshi, Genetic Algorithm and Tabu Search Attack on the Mono- Alphabetic Substitution Cipher in Adhoc Networks, Journal of Computer Science 3 (3), pp.134- 137, 2007.
Using Genetic Algorithm â€œTo Break A Mono - Alphabetic Substitution Cipherâ€, S. S. Omran, A. S. A l-Khalid, D. M. Al-Saady, 2010 IEEE Conference on Open Systems (ICOS 2010), pp. 63 -67, 2010.
G. J. Simmons, Contemporary Cryptology, â€œThe Science of Information Integrityâ€, The Institute of Electrical and Electronics Engineers, Inc., New York, 2001.
D. Kahn, The Code breakers, The New American Library, Inc., USA, 2003.
W. Stallings, cryptography and network security, Pearson Education, Inc., 4th edition, 2005.
T. Ragheb and A. Subbanagounder, Applying Genetic Algorithms for Searching Key- Space of Poly-alphabetic Substitution Ciphers, The International Arab Journal of Information Technology, Vol. 5, No. 1, pp.87 - 91, January.