Title: Encryption by Hill cipher and by a novel method using Chinese remainder theorem in Galois field

Authors: Sukant Kumar Chhotaray; Jyotirmayee Majhi; Girija Sankar Rath

Addresses: Department of Electronics and Communication Engineering, Sardar Vallabhbhai Institute of Technology, Vasad 388306, India ' Department of E&C Engineering, EAST, Prachivihar, Anantpur, Phulnakhara, Bhubaneshwar, Odisha 754001, India ' Department of Electronics and Communication Engineering, National Institute of Technology, Rourkela 769008, Odisha, India

Abstract: Security can only be as strong as the weakest link. In this world of Communication, it is now well established that the weakest link lies in the implementation of cryptographic algorithms. Galois field is extensively used in coding. Hill cipher is an old symmetric key Technique of Cryptography. Here, a novel method of Hill cipher employing Galois field particularly GF(2^m) has been used for Cryptography. This new type of cipher matrix utilises the polynomials as elements in GF(2^m). Simulation results conform the utility of such a method in data security of private networks. The second method uses the Chinese Remainder Theorem (CRT) in GF(2^m). This method is quite similar to RSA method.

Keywords: cryptography; decryption; encryption; Galois field; Hill cipher; CRT; Chinese remainder theorem; security; polynomials; simulation; data security; network security; private networks.

DOI: 10.1504/IJSISE.2013.051508

International Journal of Signal and Imaging Systems Engineering, 2013 Vol.6 No.1, pp.38 - 45

Received: 05 Feb 2011
Accepted: 31 Mar 2011
Published online: 20 Jan 2013 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article