Open Access   Article

Polyalphabetic Substitution Cipher Using Multiple Random Table

Ranju S Kartha1 , Varghese Paul2

1 School of Computer Science, Mahatma Gandhi University, Kottayam, Kerala, India.
2 Department of Information Technology, RSET, Cochin, Kerala, India.

Section:Research Paper, Product Type: Journal Paper
Volume-6 , Issue-5 , Page no. 51-58, May-2018


Online published on May 31, 2018

Copyright © Ranju S Kartha, Varghese Paul . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library


IEEE Style Citation: Ranju S Kartha, Varghese Paul, “Polyalphabetic Substitution Cipher Using Multiple Random Table”, International Journal of Computer Sciences and Engineering, Vol.6, Issue.5, pp.51-58, 2018.

MLA Style Citation: Ranju S Kartha, Varghese Paul "Polyalphabetic Substitution Cipher Using Multiple Random Table." International Journal of Computer Sciences and Engineering 6.5 (2018): 51-58.

APA Style Citation: Ranju S Kartha, Varghese Paul, (2018). Polyalphabetic Substitution Cipher Using Multiple Random Table. International Journal of Computer Sciences and Engineering, 6(5), 51-58.

95 101 downloads 14 downloads


There are many cryptographic techniques available for providing a secure communication. Encryption technique can be classified according to their encrypting process. They are substitution cipher and transposition cipher. Polyalphabetic cipher is based on substitution technique- the plaintext letters are encrypted differently depending upon their placement in the text and the keyword. Vigenere cipher is considered to be the most efficient and simplest Polyalphabetic substitution cipher. Due to its repeating nature of the keyword, it is vulnerable to attacks. To overcome this, here we are presenting a new cipher which uses multiple random Tables (26x26) for encryption. In this proposed cipher, the keyword is repeating until it is equal to the length of the plaintext. But here, whenever the keyword repeats, this cipher generates different 26x26 random tables for encryption. Also, each table will be completely independent of the previous table. So this proposed Polyalphabetic cipher is unbreakable.

Key-Words / Index Term

Polyalphabetic Cipher, Vigenere Cipher, Vigenere Table, Kasiski Method, Index of Coincidence IC


[1] Sakshi Dubey, Darpan Anand, Jayash Sharma, "LFSR Based Block Cipher Technique for Text” International Journal of Computer Sciences and Engineering, Vol.6, Issue.2, pp.54-60, 2018.
[2] P.Sri Ram Chandra, G. Venkateswara Rao, G.V. Swamy, "Modular Encryption Algorithm for Secure Data Transmission”, The International Journal of Scientific Research in Network Security and Communication, Vol.6, Issue. 1, Feb 2018.
[3] Benni Purnama, HettyRohayani A. H, “A New Modified Caesar Cipher Cryptography Method With Legible Ciphertext From A Message To Be Encrypted”, International Conference on Computer Science and Computational Intelligence (ICCSCI 2015).
[4] Behrouz A Forouzan, “Cryptography and Network Security”, Tata McGraw-Hill Publishing Company Limited, 2007.
[5] A. Eskicioglu and L. Litwin, “Cryptography”, IEEE Potentials, Vol. 20, Issue. 1, pp. 36-38February/March 2001.
[6] Ranju S Kartha, Dr. Varghese Paul, “ Survey: Recent Modifications in Vigenere cipher”, IOSR Journal of Computer Engineering (IOSR-JCE), Volume 16, Issue 2, Ver. IX, Mar-Apr. 2014.
[7] Abdul Razzaq and Yasir Mahmood, Farooq Ahmed, “Strong Key Mechanism Generated by LFSR based Vigenère Cipher”, The 13th International Arab Conference on Information Technology, ACIT`’2012, Dec.10-13
[8] Alfred J. Menezes, Paul C. van Oorschot, Scott A., “Handbook of Applied Cryptography”, CRC Press, 1996.
[9] Navnish Goel, Amitabh Maurya, Babloo Kumar, “Information Security: Encryption and Decryption with Polyalphabetic Substitution Method”, International Journal of Computer Science and Communication, Vol. 2, January-June 2011.
[10] Prof.Ravindra Babu Kallam, Dr. S.Udaya Kumar, Dr. A.Vinaya babu, V.Shravan Kumar, “A Contemporary Polyalphabetic Cipher using Comprehensive Vigenere Table”, World of Computer Science and Information Technology Journal, Vol. 1, 2011.