International Journal of Computer Theory and Engineering

Editor-In-Chief: Prof. Mehmet Sahinoglu
Frequency: Quarterly
ISSN: 1793-8201 (Print), 2972-4511 (Online)
E-mali:editor@ijcte.org
Publisher:IACSIT Press
OPEN ACCESS
4.1
CiteScore

⚠️ Important Security Notice: Beware of Fraudulent Emails Impersonating IJCTE Officials
Home > Articles > Archive > 2009 > Volume 1, Number 5 (Dec. 2009) >
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.

Article Metrics in Dimensions

Previous Paper
A Novel Approach for Estimation and Optimization of Memory In Low Power Embedded Systems
Next Paper
A Modified Playfair Cipher Involving Interweaving and Iteration
Menu