Binary LU encryption
Abdelahaliem Abbas Othman · 2013
In this paper, an encryption scheme using binary matrices as an encryption/decryption keys is presented. The scheme can be viewed as a binary version of the classical Hill Cipher with a new method for generating a random key-matrix and its inverse simultaneously using LU factorization method. The scheme is resistant to the known-plain-text attack, which is the main weakness in the classical Hill Cipher. Bitwise operations in matrix multiplications were used, and the speed is comparable to AES.