Lester S. Hill in 1929 introduced non-singular matrices to encrypt and decrypt the message in the symmetric key cryptography. Block ciphers designing and cryptographic hash functions have the use of matrices. Here, we introduce permutations, iterations and finite field in the Hill cipher to provide more security and make it free from vulnerable attacks.
AMS Classification: 11T71, 94A60.
Cite this article:
P. L. Sharma, S. Sharma. An Application of Finite Field in Hill Cipher. Int. J. Tech. 4(1): Jan.-June. 2014; Page 248-251