  In this paper, we describe non invertible matrix in GF(2)which can be used as
multiplication matrix in Hill Cipher technique for one way hash algorithm. The
matrices proposed are permutation matrices with exactly one entry 1 in each row
and each column and 0 elsewhere. Such matrices represent a permutation of m
elements. Since the invention, Hill cipher algorithm was used for symmetric
encryption, where the multiplication matrix is the key. The Hill cipher
requires the inverse of the matrix to recover the plaintext from cipher text.
We propose a class of matrices in GF(2) which are non invertible and easy to
generate.
