Playfair cipher example

We are excited to announce that we are moving from JavaTpoint. Stay tuned for an enhanced experience with the same great content and even more features. Thank you for your continued support! Playfair cipher is proposed by Charles Whetstone in But it was named for one of his friends Lord Lyon Playfair because he popularized its uses.

It is the most popular symmetric encryption technique that falls under the substitution cipher. It is an encoding procedure that enciphers more than one letter at a time. In this section, we will discuss Playfair cipher along with its implementation in a Java program. Playfair cipher is an encryption algorithm to encrypt or encode a message.

It is the same as a traditional cipher. The only difference is that it encrypts a digraph a pair of two letters instead of a single letter. The matrix contains alphabets that act as the key for encryption of the plaintext.

Playfair cipher decoder

Note that any alphabet should not be repeated. Another point to note that there are 26 alphabets and we have only 25 blocks to put a letter inside it. Therefore, one letter is excess so, a letter will be omitted usually J from the matrix.