Hill Algorithm Decryption using Parallel Calculations by Brute Force

Abstract

Hill coding, based on linear algebra, by the American mathematician Lester S. Hill in 1929 in this method we use a square matrix A of integers as a key, which determines the linear transformation Y = A * X where Y, X they are the column vectors. Using this encryption method, a text was encrypted to later decrypt it with the use of brute force, that is, to test each of the possible combinations of keys to find the original text in this article. A 2x2 key was used to encrypt the text with a limit from 1 to 256 for each element in the matrix 256 x 256 x 256 x 256 permutations were found that is 4,294,967,296 possible keys for this decipher this text as it can be clearly seen there are too many operations to perform that can consume a considerable time for the CPU since he must decipher the text for each of these combinations and find the correct one, that is why to do this arduous task, parallel programming was used to generate each of the keys and work with each one of them.