Vigenère Cipher

Vigenere Cipher is a method of encrypting alphabetic text. It uses a simple form of polyalphabetic substitution. A polyalphabetic cipher is any cipher based on substitution, using multiple substitution alphabets .The encryption of the original text is done using the Vigenère square or Vigenère table.

  • The table consists of the alphabets written out 26 times in different rows, each alphabet shifted cyclically to the left compared to the previous alphabet, corresponding to the 26 possible Caesar Ciphers.
  • At different points in the encryption process, the cipher uses a different alphabet from one of the rows.
  • The alphabet used at each point depends on a repeating keyword.


Input : Plaintext :   TECHCODEBIT
             Keyword :  TECHS
Output : Ciphertext :  GCYCZFMLYLEIM
For generating key, the given keyword is repeated
in a circular manner until it matches the length of 
the plain text.
The keyword "TECHS" generates the key "AYUSHAYUSHAYU"
The plain text is then encrypted using the process 
explained below.

The first letter of the plaintext, G is paired with A, the first letter of the key. So use row G and column A of the Vigenère square, namely G. Similarly, for the second letter of the plaintext, the second letter of the key is used, the letter at row E and column Y is C. The rest of the plaintext is enciphered in a similar fashion.



Decryption is performed by going to the row in the table corresponding to the key, finding the position of the ciphertext letter in this row, and then using the column’s label as the plaintext. For example, in row A (from TECHS), the ciphertext G appears in column G, which is the first plaintext letter. Next we go to row Y (from TECHS), locate the ciphertext C which is found in column E, thus E is the second plaintext letter.

A more easy implementation could be to visualize Vigenère algebraically by converting [A-Z] into numbers [0–25].

The the plaintext(P) and key(K) are added modulo 26.
Ei = (Pi + Ki) mod 26

Di = (Ei - Ki + 26) mod 26

Note: Di denotes the offset of the i-th character of the plaintext. Like offset of A is 0 and of B is 1 and so on.

Below is C++ implementation of the idea.

// C++ code to implement Vigenere Cipher
using namespace std;
// This function generates the key in
// a cyclic manner until it's length isi'nt
// equal to the length of original text
string generateKey(string str, string key)
    int x = str.size();
    for (int i = 0; ; i++)
        if (x == i)
            i = 0;
        if (key.size() == str.size())
    return key;
// This function returns the encrypted text
// generated with the help of the key
string cipherText(string str, string key)
    string cipher_text;
    for (int i = 0; i < str.size(); i++)
        // converting in range 0-25
        int x = (str[i] + key[i]) %26;
        // convert into alphabets(ASCII)
        x += 'A';
    return cipher_text;
// This function decrypts the encrypted text
// and returns the original text
string originalText(string cipher_text, string key)
    string orig_text;
    for (int i = 0 ; i < cipher_text.size(); i++)
        // converting in range 0-25
        int x = (cipher_text[i] - key[i] + 26) %26;
        // convert into alphabets(ASCII)
        x += 'A';
    return orig_text;
// Driver program to test the above function
int main()
    string str = "<a href="#">TECHCODEBIT</a>";
    string keyword = "AYUSH";
    string key = generateKey(str, keyword);
    string cipher_text = cipherText(str, key);
    cout << "Ciphertext : "
         << cipher_text << "\n";
    cout << "Original/Decrypted Text : "
         << originalText(cipher_text, key);
    return 0;


Original/Decrypted Text : TECHCODEBIT

Disclaimer: This does not belong to TechCodeBit, its an article taken from the below
source and credits.
source and credits:
We have built the accelerating growth-oriented website for budding engineers and aspiring job holders of technology companies such as Google, Facebook, and Amazon
If you would like to study our free courses you can join us at #techcodebit #google #microsoft #facebook #interview portal #jobplacements


Leave a Reply

Your email address will not be published. Required fields are marked *

Skip to toolbar