HILL CIPHER :

• Hill cipher is a polygraphic substitution cipher based

on linear algebra. Each letter is represented by a
number modulo 26. Often the simple scheme A = 0, B =
1, …, Z = 25 is used.

• Developed by Lester Hill in 1929.

• Encrypts a group of letters : digraph, trigraph or

polygraph.
 ENCRYPTION :
• This can be expressed as:
C = E(K,P) = P x K mod 26
HILL CIPHER ENCRYPTION :

• Question : Encrypt ( pay more money ) using Hill

Cipher with key.
Encrypting pay :
Encrypting mor :
Encrypting emo :
Encrypting ney :
The Result :
 DECRYPTION :

P = D(K,C) = C 𝐊 −𝟏 mod 26 = P x K x 𝐊 −𝟏 mod 26

• Question : Decrypt ( RRLMWBKASPDH ) using Hill Cipher with key.

We will take only first row numbers, the first
number will be positive, the second one will be
negative and the third will be positive.
Write down first 2 columns and first 2 rows:
We will focus on 4 by 4 matrix by removing first
row and first column:
Multiply numbers:
The equation is:

We will put values we found in the equation:

 The inverse of 23 equals 17 because the remainder is 1 when the
inverse equals 17:

Multiply 17 by matrix and take mod 26:

Here we will multiply K by K Inverse to ensure the
correction of our result:

The main diagonal is 1 that is why we have the

correct result of K Inverse
Decrypting RRL:
Decrypting MWB:
Decrypting KAS:
Decrypting PDH:
The Result:
 REFERENCES:

• 1. NESO ACADEMY ( YouTube )

• 2.https://www.tutorialspoint.com/cryptography/benefits_and_drawbac
ks.htm

• 3. https://www.geeksforgeeks.org/hill-cipher/

• 4. https://www.kaspersky.com/resource-center/definitions/what-is-
cryptography