Caesar Cipher Technique

The Caesar cipher is the simplest and oldest method of cryptography. The Caesar cipher method is based on a mono-alphabetic cipher and is also called a shift cipher or additive cipher. Julius Caesar used the shift cipher (additive cipher) technique to communicate with his officers. For this reason, the shift cipher technique is called the Caesar cipher. The Caesar cipher is a kind of replacement (substitution) cipher, where all letter of plain text is replaced by another letter.

Let's take an example to understand the Caesar cipher, suppose we are shifting with 1, then A will be replaced by B, B will be replaced by C, C will be replaced by D, D will be replaced by C, and this process continues until the entire plain text is finished.

Caesar ciphers is a weak method of cryptography. It can be easily hacked. It means the message encrypted by this method can be easily decrypted.

Plaintext: It is a simple message written by the user.

Ciphertext: It is an encrypted message after applying some technique.

The formula of encryption is:

E_n (x) = (x + n) mod 26

The formula of decryption is:

D_n (x) = (xi - n) mod 26

If any case (Dn) value becomes negative (-ve), in this case, we will add 26 in the negative value.

Where,

E denotes the encryption
D denotes the decryption
x denotes the letters value
n denotes the key value (shift value)

Note: "i" denotes the offset of the ith number of the letters, as shown in the table below.

Example: 1 Use the Caesar cipher to encrypt and decrypt the message "JAVATPOINT," and the key (shift) value of this message is 3.

Encryption

We apply encryption formulas by character, based on alphabetical order.

The formula of encryption is:

E_n (x) = (x + n) mod 26

Plaintext: J → 09	E_n: (09 + 3) mod 26	Ciphertext: 12 → M
Plaintext: A → 00	E_n: (00 + 3) mod 26	Ciphertext: 3 → D
Plaintext: V → 21	E_n: (21 + 3) mod 26	Ciphertext: 24 → Y
Plaintext: A → 00	E_n: (00 + 3) mod 26	Ciphertext: 3 → D
Plaintext: T → 19	E_n: (19 + 3) mod 26	Ciphertext: 22 → W
Plaintext: P → 15	E_n: (15 + 3) mod 26	Ciphertext: 18 → S
Plaintext: O → 14	E_n: (14 + 3) mod 26	Ciphertext: 17 → R
Plaintext: I → 08	E_n: (08 + 3) mod 26	Ciphertext: 11 → L
Plaintext: N → 13	E_n: (13 + 3) mod 26	Ciphertext: 16 → Q
Plaintext: T → 19	E_n: (19 + 3) mod 26	Ciphertext: 22 → W

The encrypted message is "MDYDWSRLQW". Note that the Caesar cipher is monoalphabetic, so the same plaintext letters are encrypted as the same letters. For example, "JAVATPOINT" has "A", encrypted by "D".

Decryption

We apply decryption formulas by character, based on alphabetical order.

The formula of decryption is:

D_n (x) = (x_i - n) mod 26

If any case (D_n) value becomes negative (-ve), in this case, we will add 26 in the negative value.

Ciphertext: M → 12	D_n: (12 - 3) mod 26	Plaintext: 09 → J
Ciphertext: D → 03	D_n: (03 - 3) mod 26	Plaintext: 0 → A
Ciphertext: Y → 24	D_n: (24 - 3) mod 26	Plaintext: 21 → V
Plaintext: A → 00	E_n: (00 + 3) mod 26	Ciphertext: 3 → D
Plaintext: T → 19	E_n: (19 + 3) mod 26	Ciphertext: 22 → W
Plaintext: P → 15	E_n: (15 + 3) mod 26	Ciphertext: 18 → S
Plaintext: O → 14	E_n: (14 + 3) mod 26	Ciphertext: 17 → R
Plaintext: I → 08	E_n: (08 + 3) mod 26	Ciphertext: 11 → L
Plaintext: N → 13	E_n: (13 + 3) mod 26	Ciphertext: 16 → Q
Plaintext: T → 19	E_n: (19 + 3) mod 26	Ciphertext: 22 → W

The decrypted message is "JAVATPOINT".

Example: 2 Use the Caesar cipher to encrypt and decrypt the message "HELLO," and the key (shift) value of this message is 15.

Encryption

We apply encryption formulas by character, based on alphabetical order.

The formula of encryption is:

E_n (x) = (x + n) mod 26

Plaintext: H → 07	E_n: (07 + 15) mod 26	Ciphertext: 22 → W
Plaintext: E → 04	E_n: (04 + 15) mod 26	Ciphertext: 19 → T
Plaintext: L → 11	E_n: (11 + 15) mod 26	Ciphertext: 00 → A
Plaintext: L → 11	E_n: (11 + 15) mod 26	Ciphertext: 00 → A
Plaintext: O → 14	E_n: (14 + 15) mod 26	Ciphertext: 03 → D

Note that the Caesar cipher is monoalphabetic, so the same plaintext letters are encrypted as the same letters. Like, "HELLO" has "L", encrypted by "A".

The encrypted message of this plain text is "WTAAD".

Decryption

We apply decryption formulas by character, based on alphabetical order.

The formula of decryption is:

D_n (x) = (xi - n) mod 26

Ciphertext: W → 22	D_n: (22 - 15) mod 26	Plaintext: 07 → H
Ciphertext: T → 19	D_n: (19 - 15) mod 26	Plaintext: 04 → E
Ciphertext: A → 00	D_n: (00 - 15) mod 26	Plaintext: 11 → L
Ciphertext: A → 00	D_n: (00 - 15) mod 26	Plaintext: 11 → L
Ciphertext: D → 03	D_n: (03 - 15) mod 26	Plaintext: 14 → O

The decrypted message is "HELLO".

Note: If any case (D_n) value becomes negative (-ve), in this case, we will add 26 in the negative value. Like, the third letter of the ciphertext.

D_n = (00 - 15) mod 26
= -15

The value of dn is negative, so 26 will be added to it.

= -15 + 26
= 11

Advantages of Caesar cipher

Its benefits are as follows: -

It is very easy to implement.
This method is the simplest method of cryptography.
Only one short key is used in its entire process.
If a system does not use complex coding techniques, it is the best method for it.
It requires only a few computing resources.

Disadvantages of Caesar cipher

Its disadvantages are as follows: -

It can be easily hacked. It means the message encrypted by this method can be easily decrypted.
It provides very little security.
By looking at the pattern of letters in it, the entire message can be decrypted.

Program

C program for the encryption:

#include<stdio.h>
#include<conio.h>
int main()
{
    int i, f;
    char pop[100], c;    
    printf(" enter a plaintext \n");
    gets(pop);
    printf("enter key");
    scanf("%d", &f);
    for(i = 0; pop[i] ! = '\0'; i++)
    {
        c = pop[i];
        if(c >= 'a' && c <= 'z')
        {
            c = c + f;
            if(c > 'z')
            {
                c = c - 'z' + 'a' - 1;
            }
            pop[i] = c;
        }
        else if(c >= 'A' && c < 'Z')
        {
            c = c + f;
            if(c > 'Z')
            {
                c = c = 'Z' + 'A' - 1;
            }
            pop[i] = c;
        }
    }
    printf(" Encrypted message: %s", pop);
    return 0;
}

C program for the decryption

#include<stdio.h>
#include<conio.h>
int main()
{
    int i, f;
    char pop[100], c;
    printf("enter a encrypted test \t");
    gets(pop);
    printf("enter key \t");
    scanf("%d", &f);
    for(i = 0; pop[i] != '\0'; i++)
    {
        c = pop[i];
        if(c >= 'a' && c <= 'z')
        {
            c = c - f;
            if(c < 'a')
            {
                c = c + 'z' - 'a' + 1;
            }
            pop[i] = c;
        }
        else if(c >= 'A' && c < 'Z')
        {
            c = c + f;
            if(c < 'A')
            {
                c = c + 'Z' - 'A' + 1;
            }
            pop[i] = c;
        }
    }
    printf(" Dycrypted message: %s", pop);
    return 0;
}

Next TopicProgramming Language

← prev next →