Hill cipher encryption in computer cryptography | hill cipher encryption with example

In this computer cryptography and network security tutorial, we will learn about Hill cipher encryption in computer cryptography. We will see Hill cipher encryption with example. We will learn: What is Hill Cipher? What is the formula for Hill Cipher encryption? Then we will learn what are the requirements for encryption with Hill cipher. Finally we will look at an EXAMPLE, of Encryption with Hill Cipher. What is Hill Cipher? Hill cipher is a Polygraphic substitution Cipher Developed by Lester Hill in the year 1929. Polygraphic substitution means multi-letter substitution i.e. substitution is performed on blocks of letters where the length of the block is specific. For example, we will look at an example where we substitute block of 2 letters at a time, hence we can call it ‘Bi-graphic’. What is the Formula for encryption in Hill Cipher? The Formula for encryption with Hill Cipher is: KP(mod26) Where K means key or encryption key P means plain text Mod26 means we perform modulo operation on the matrix product with 26. what are the requirements for encryption with Hill cipher? First we need to have a table ready which represents all the letters with their respective numeric value like a=0, b=1, c=2,…z=25. Second we need to know how to perform matrix multiplication. Finally we need to know how to perform mod operation. EXAMPLE: So we will encrypt the words: “Hello friends”. The Key we will use to encrypt will be: “Help” The formula for Hill cipher encryption is: KP(mod26) So we will follow these steps to encrypt our plain-text. Thank you guys for watching this video. My computer cryptography playlist: https://www.youtube.com/playlist?list=PL58YSwlpvFr202tgXEOMo3J4z9awSZrpN PLEASE SUBSCRIBE TO OUR CHANNEL. LIKE AND SHARE THIS VIDEO.