A Survey Paper on Different Modification of Playfair Cipher

Bhavya Alankar, MOHAMMED HARIS


Working of Playfair cipher depends on the characters that are first grouped in blocks and later substituted. We can add as many as block of messages but the size should be defined as 2 alphabets per block, known as diagraphs.Playfair cipher operates on block of characters encrypting and decrypting two characters at a time. In this cipher, the plain text digraphs are converted to cipher text digraphs and the cipher text digraphs are converted to decrypted text digraphs using a shared key known to both the encrypter and decrypter. Due to the traditional 5 x 5 matrix used in Playfair cipher it supports twenty five uppercase alphabets only. To overcome the drawbacks and limitations, various authors have proposed their modifications of Playfair cipher. The paper contains different variants of Playfair cipher proposed by different scholars on the basis of their respected parameters.


Cryptography, Decryption, Encryption, Playfair Cipher, Security, Substitution, Symmetric Key

Full Text:



K. Ravindra Babu, S. Uday Kumar, A. Vinay Babu, I. V. N. S. Aditya and P. Komuraiah, “An Extension to Traditional Playfair Cryptographic Method”, International Journal of Computer Applications (0975 – 8887), vol. 17, no. 5, (2011) March.

S. S. Srivastava and N. Gupta, “A Novel Approach to Security using Extended Playfair Cipher”, International Journal of Computer Applications (0975 – 8887), vol. 20, no. 6, (2011) April.

S. Basu and U. K. Ray, “Modified Playfair Cipher using Rectangular Matrix”, International Journal of Computer Applications (0975 – 8887), vol. 46, no. 9, (2012) May.

P. Murali and G. Senthilkumar, “Modified Version of Playfair Cipher using Linear Feedback Shift Register”, IJCSNS International Journal of Computer Science and Network Security, vol. 8, no. 12, (2008) December.

G. Agrawal, S. Singh and M. Agarwal, “An Enhanced and Secure Playfair Cipher by Introducing the Frequency of Letters in any Plain text”, Journal of Current Computer Science and Technology, vol. 1, no. 3, (2011), pp. 10-16

A. Alam, S. Ullah, I. Wahid and S. Khalid, “Universal Playfair Cipher Using MXN Matrix”, International Journal of Advanced Computer Science, vol. 1, no. 3, (2011).

Ouday Nidhal Ameen Hanosh and BaraaWasfi Salim, “11 × 11 Playfair Cipher based on a Cascade of LFSRs”. IOSR Journal of Computer Engineering (IOSR-JCE) e-ISSN: 2278-0661, p- ISSN: 2278-8727Volume 12, Issue 1, PP 29-35, May-Jun. 2013.

Kaur A.; Verma H. K.; Singh R. K., 3D (4 X 4 X 4) - Playfair Cipher, International Journal of Computer Applications, 51 (2), pp. 36-38, 2012.

V. Verma, D. Kaur, R. K. Singh and A. Kaur, “3D- Playfair cipher with additional bitwise operation”, In Control Computing Communication & Materials (ICCCCM), 2013 International Conference on IEEE, (2013), August, pp. 1-6.

N. Chand and S. Bhattacharyya, “A Novel Approach for Encryption of Text Messages Using PLAY-FAIR Cipher 6 by 6 Matrix with Four Iteration Steps”, International Journal of Engineering Science and Innovative Technology (IJESIT), vol. 3, no. 1, (2014) January, pp. 478-484.

S. S. Dhenakaran and M. Ilayaraja, “Extension of Playfair Cipher using 16X16 Matrix”, International Journal of Computer Applications (0975 – 888), vol. 48, no. 7, (2012) June.

Swati Hans, Rahul Johari, Vishakha Gautam, “An Extended PlayFair Cipher using Rotation and Random Swap patterns,” 5th IEEE International Conference on Computer and Communication Technology, (2014).

DOI: https://doi.org/10.26483/ijarcs.v8i5.3341


  • There are currently no refbacks.

Copyright (c) 2017 International Journal of Advanced Research in Computer Science