Scribd
Upload
386 views22 pages

Hill Cipher

The document describes Hill Ciphers, a polygraphic substitution cipher invented in 1929. It uses linear algebra and modular arithmetic to encrypt messages by applying an encryption matrix to blocks of letters, and decrypts using the inverse decryption matrix. Frequency analysis is more difficult with polygraphic ciphers. Key aspects include assigning numbers to letters, converting messages to numeric vectors, multiplying vectors by the encryption matrix, and converting the results back to letters.

Uploaded by

pavan yadav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
386 views22 pages

Hill Cipher

The document describes Hill Ciphers, a polygraphic substitution cipher invented in 1929. It uses linear algebra and modular arithmetic to encrypt messages by applying an encryption matrix to blocks of letters, and decrypts using the inverse decryption matrix. Frequency analysis is more difficult with polygraphic ciphers. Key aspects include assigning numbers to letters, converting messages to numeric vectors, multiplying vectors by the encryption matrix, and converting the results back to letters.

Uploaded by

pavan yadav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 22

Hill Ciphers

Hill Ciphers
 Created by Lester S. Hill in 1929
 Polygraphic Substitution Cipher
 Uses Linear Algebra to Encrypt and
Decrypt
Simple Substitution Ciphers
 Work by substituting one letter with
another letter.
 Easy to crack using Frequency Analysis
Letter to Letter Substitution
A B C D E F G H I J K L M
Q W E R T Y U I O P A S D

N O P Q R S T U V W X Y Z
F G H J K L Z X C V B N M

Unencrypted = HELLO WORLD

Encrypted = ITSSG VKGSR


Polygraphic Substitution Ciphers
 Encrypts letters in groups
 Frequency analysis more difficult
Hill Ciphers
 Polygraphic substitution cipher
 Uses matrices to encrypt and decrypt
 Uses modular arithmetic (Mod 26)
Modular Arithmetic
 For a Mod b, divide a by b and take the
remainder.
 14 ÷ 10 = 1 R 4
 14 Mod 10 = 4
 24 Mod 10 = 4
Modulus Examples
Modularly Inverse Matrices
 Calculate determinant of first matrix A,
det A
 Make sure that det A has a modular
inverse for Mod 26
 Calculate the adjugate of A, adj A
 Multiply adj A by modular inverse of det A
 Calculate Mod 26 of the result to get B
 Use A to encrypt, B to decrypt
Modular Reciprocal Example
Encryption
 Assign each letter in alphabet a number
between 0 and 25
 Change message into 2 x 1 letter vectors
 Change each vector into 2 x 1 numeric
vectors
 Multiply each numeric vector by
encryption matrix
 Convert product vectors to letters
Letter to Number Substitution
A B C D E F G H I J K L M
0 1 2 3 4 5 6 7 8 9 10 11 12

N O P Q R S T U V W X Y Z
13 14 15 16 17 18 19 20 21 22 23 24 25
Change Message to Vectors
Message to encrypt = HELLO WORLD
Multiply Matrix by Vectors
Convert to Mod 26
Convert Numbers to Letters

HELLO WORLD has been encrypted to


SLHZY ATGZT
Decryption
 Change message into 2 x 1 letter vectors
 Change each vector into 2 x 1 numeric
vectors
 Multiply each numeric vector by
decryption matrix
 Convert new vectors to letters
Change Message to Vectors
Message to encrypt = SLHZYATGZT
Multiply Matrix by Vectors
Convert to Mod 26
Convert Numbers to Letters

SLHZYATGZT has been decrypted to


HELLO WORLD
Conclusion
 Creating valid encryption/decryption
matrices is the most difficult part of Hill
Ciphers.
 Otherwise, Hill Ciphers use simple linear
algebra and modular arithmetic

You might also like