A Survey of Existing Playfair Ciphers
Jitendra Choudhary1, Ravindra Kumar Gupta2, Shailendra Singh3
1Jitendra Choudhary, Computer Science Department, SSSIST, Sehore, India.
2Prof. Ravindra Kumar Gupta, Computer Science Department, SSSIST, Sehore, India.
3Dr. Shailendra Singh, Computer Science Department, NITTTR, Bhopal, India.
Manuscript received on March 02, 2013. | Revised Manuscript received on April 13, 2013. | Manuscript published on April 30, 2013. | PP: 658-659 | Volume-2, Issue-4, April 2013. | Retrieval Number: D1568042413/2013©BEIESP

Open Access | Ethics and Policies | Cite
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: The role of cryptography in today’s world is increasing day by day. Information is flowing from one place to another on the network. One most common cryptography technique is substitution cipher. Play fair is most common substitution cipher. In this paper, we present an overview of existing playfair ciphers. Encryption/decryption is a very popular task. We also explain the fundamentals of sequential cryptography. We describe today’s approaches for play fair cipher. Their strengths and weaknesses are also investigated. It turns out that the behavior of the algorithms is much more similar as to be expected.
Keywords: Cryptography, Network Security, Symmetric Key, Play fair cipher and substitution.