5.
Algorithm Applications
To demonstrate the practical application of the Hill Cipher, we created a MATLAB pro-
gram that performs both encryption and decryption. This code serves as a hands-on
experiment to illustrate how the Hill Cipher transforms plain text into cipher text using
a key matrix and how the original message can be recovered by applying the inverse
operation. By creating this program, the theoretical concepts of linear algebra and mod-
ular arithmetic underlying the Hill Cipher are made tangible, allowing for interactive
exploration of its cryptographic process.
To illustrate how the Hill Cipher works in practice, the MATLAB program is divided
into seven clear steps, each representing a specific part of the encryption and decryption
workflow. The code includes detailed green comments that explain the purpose of every
line, ensuring that even beginners can follow how the plaintext is processed, how the
key matrix is validated, and how the cipher operations are performed. This structured,
step-by-step breakdown makes the entire cryptographic process transparent and easy to
understand.
Step 1 — User Input
In this step, the program asks the user to enter a sentence and choose whether they want
to encrypt or decrypt it. This establishes the basic information required for the Hill
Cipher to operate.
Figure 1: Step 1
Step 2 — Converting the Sentence
The input is cleaned by converting all letters to uppercase, trimming extra spaces, and
splitting the text into individual words. This ensures the data is in the correct format
before applying the cipher.
Figure 2: Step 2
1
Step 3 — Key Matrix Input and Validation
The user is prompted to enter a 2×2 key matrix, which is then checked to ensure it
satisfies the mathematical requirements of the Hill Cipher, such as having a determinant
that is non-zero and invertible mod 26. This prevents invalid keys that would make
encryption or decryption impossible.
Figure 3: Step 3
2
Step 4 — Key Preparation for Decryption
This step is only required for decryption. While encryption directly uses the original
key matrix, decryption requires the program to compute the modular inverse of the key
matrix so that it can reverse the transformation applied during encryption.
Figure 4: Step 4
Step 5 — Alphabet Mapping Setup
The program defines the alphabet (A–Z) and prepares an output structure to store en-
crypted or decrypted words. This creates a consistent reference for converting between
letters and numbers.
Figure 5: Step 5
3
Step 6 — Encryption / Decryption Process
Each word is converted into numerical form, padded if necessary, and processed using
matrix multiplication with either the key or its inverse. The resulting numbers are then
transformed back into letters to produce the encrypted or decrypted output.
Figure 6: Step 6
Step 7 — Displaying the Final Result
Finally, all processed words are combined and displayed to the user. This presents the
complete ciphertext or plaintext produced by the Hill Cipher.
Figure 7: Step 7
4
Example 1: Encryption
Now, to illustrate how the Hill Cipher works in practice, we will show an example of
the program in action. The user inputs a plaintext message, and the MATLAB code
produces the corresponding encrypted output using the chosen key matrix.
Figure 8: Encrypting the sentence
Example 2: Decryption
Similarly, we can demonstrate decryption using the same key. The ciphertext is input into
the program, which calculates the inverse key matrix and returns the original plaintext,
showing the full encryption-decryption cycle.
Figure 9: Decrypting the sentence
In this project, a MATLAB program was developed to demonstrate the Hill Cipher
encryption and decryption process. The program allows users to input plaintext and a
key matrix, performs the necessary matrix operations, and produces the corresponding
ciphertext or recovered plaintext. Through this implementation, the workflow of the Hill
Cipher was clearly illustrated, highlighting the importance of key validation, modular
arithmetic, and matrix inversion in cryptography. Overall, this experiment provides a
practical understanding of how classical ciphers can be applied and tested using compu-
tational tools.