Modified Hill-Cipher and CRT Methods in Galois Field GF (2^M)for Cryptography

Abstract

Security can only be as strong as the weakest link. In this world of Cryptography, it is now well established, that the weakest link lies in the implementation of cryptographic algorithms. Galois field is extensively used in coding. Recently Galois field particularly GF(2^M) has been used for Cryptography. Hill-cipher is an old symmetric key Technique of Cryptography. In this project, a novel method of Hill-cipher has been introduced in Cryptography. This new type of cipher matrix utilizes. The polynomials as element in GF(2^M) . Simulation and results confirm the utility such a data security in a private network. In addition to this, encryption and decryption of data are implemented in GF(2^M) using the principle of data Chinese Remainder Theorem.