• May 27, 2016 News!The submission for Special Issue is officially open now!   [Click]
  • May 03, 2016 News!Vol.6, No.6 has been indexed by EI (Inspec).   [Click]
  • Mar 17, 2017 News!Vol.9, No.2 has been published with online version. 13 peer reviewed articles from 4 specific areas are published in this issue.   [Click]
General Information
Editor-in-chief
Prof. Wael Badawy
Department of Computing and Information Systems Umm Al Qura University, Canada
I'm happy to take on the position of editor in chief of IJCTE. We encourage authors to submit papers concerning any branch of computer theory and engineering.
IJCTE 2009 Vol.1(5): 592-596 ISSN: 1793-8201
DOI: 10.7763/IJCTE.2009.V1.95

A Modified Playfair Cipher for a Large Block of Plaintext

V. Umakanta Sastry, N. Ravi Shankar, and S. Durga Bhavani
Abstract—In this paper, we have extended the analysis of the modified Playfair cipher, which includes interweaving and iteration, by considering a plaintext of any size. Here, we have carried out cryptanalysis and examined the avalanche effect. From this analysis, we have found that the cipher is a strong one and it cannot be broken by any cryptanalytic attack.

Index Terms—interweaving, inverse interweaving, substitution matrix.

V. Umakanta Sastry is with the Department of Computer Science and Engineering, Sreenidhi Institute of Science and Technology, India. Phone:919985012707, fax:914027640394, e-mail: vuksastry@rediffmail.com.
N. Ravi Shankar is with the Department of Computer Science and Engineering, Sreenidhi Institute of Science and Technology, Hyderabad, India.
S. Durga Bhavani is with the School of Information Technology, J.N.T. University, Hyderabad, India.

[PDF]

Cite: V. Umakanta Sastry, N. Ravi Shankar, and S. Durga Bhavani, "A Modified Playfair Cipher for a Large Block of Plaintext," International Journal of Computer Theory and Engineering vol. 1, no. 5, pp. 592-596, 2009.
Copyright © 2008-2015. International Journal of Computer Theory and Engineering. All rights reserved.
E-mail: ijcte@vip.163.com