Abstract
Playfair cipher is a digraph cipher which is not preferred now a day for two main reasons. Firstly, it can be easily cracked if there is enough text and secondly, frequency analysis of digraph is anyway possible. This paper proposes a new solution, which encrypts / decrypts each byte by applying the Playfair on its nibbles with the help of a reduced 4×4 Key matrix. This byte by byte encryption supports any character (even multilingual character), number (of any base), symbol and any type of media file and thereby ensures flexibility. Randomness of the algorithm is achieved by rotating the key matrix randomly after encryption / decryption of each byte. Several operations are performed to support the mechanism of lightweight cryptography. The proposed method is implemented and compared with other popular ciphers on the basis of certain parameters, like Avalanche Effect, Time Complexity, and Space Requirement. The result obtained demonstrates efficiency of the proposed algorithm.
Chapter PDF
Similar content being viewed by others
References
Playfair Cipher, http://en.wikipedia.org/wiki/Playfair_cipher (October 21, 2011)
Ravindra Babu, K., Uday Kumar, S., Vinay Babu, A., Aditya, I.V.N.S., Komuraiah, P.: An Extension to Traditional Playfair Cryptographic Method. International Journal of Computer Application 17(5), 34–37 (2011)
Srivastava, S.S., Gupta, N.: Security aspects of the Extended Playfair cipher. In: International Conference on Communication Systems and Network Technologies, pp. 144–147 (2011)
Umakanta Sastry, V., Ravi Shankar, N., Durga Bhavani, S.: A Modified Playfair Cipher Involving Interweaving and Iteration. International Journal of Computer Theory and Engineering 1(5), 597–601 (2009)
Umakanta Sastry, V., Ravi Shankar, N., Durga Bhavani, S.: A Modified Playfair for a Large Block of Plaintext. International Journal of Computer Theory and Engineering 1(5), 592–596 (2009)
Ravindra Babu, K., Udaya Kumar, S., Vinaya Babu, A., Reddy, T.: A Block Cipher Generation Using Color Substitution. International Journal of Computer Applications (0975 - 8887) 1(28), 25–27 (2010)
Sabry, M., Hashem, M., Nazmy, T., Khalifa, M.E.: A DNA and Amino Acids-Based Implementation of Playfair Cipher. (IJCSIS) International Journal of Computer Science and Information Security 8(3), 129–136 (2010)
Murali, P., Senthilkumar, G.: Modified Version of Playfair Cipher using Linear Feedback Shift Register. In: 2009 International Conference on Information Management and Engineering, pp. 488–490 (2009)
Saeed, F., Rashid, M.: Integrating Classical Encryption with Modern Technique. IJCSNS International Journal of Computer 280 Science and Network Security 10(5), 280–285 (2010)
Mondal, U.K., Mandal, S.N., PalChoudhury, J.: A Framework for the Development Playfair Cipher Considering Probability of Occurrence of Characters in English Literature. 2009 International Journal of Computer Science and Network Security 8(8) (August 2008)
Bishop, D.: Introduction to cryptography with Java applets (2005)
Stallings, W.: Cryptography and network security: principles and practice, 5th edn. Prentice Hall International (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
Mukherjee, S., Chattopadhyay, M., Lahiri, A., Chattopadhyay, S. (2012). An Efficient Binary Playfair Algorithm Using a 4×4 Playfair Key Matrix. In: Cortesi, A., Chaki, N., Saeed, K., Wierzchoń, S. (eds) Computer Information Systems and Industrial Management. CISIM 2012. Lecture Notes in Computer Science, vol 7564. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33260-9_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-33260-9_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33259-3
Online ISBN: 978-3-642-33260-9
eBook Packages: Computer ScienceComputer Science (R0)