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

Majhi, Jyotirmayee (2009) Modified Hill-Cipher and CRT Methods in Galois Field GF (2^M)for Cryptography. MTech thesis.



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.

Item Type:Thesis (MTech)
Uncontrolled Keywords:cryptography, Galois field, Primitive polynomial,Hill-ciphers
Subjects:Engineering and Technology > Electronics and Communication Engineering > Cryptography
Divisions: Engineering and Technology > Department of Electronics and Communication Engineering
ID Code:1516
Deposited By:Jyotirmayee Majhi
Deposited On:17 Jun 2009 17:12
Last Modified:17 Jun 2009 17:12
Related URLs:
Supervisor(s):Rath, G S

Repository Staff Only: item control page