Encryption by Hill cipher and by a novel method using Chinese remainder theorem in Galois field
by Sukant Kumar Chhotaray; Jyotirmayee Majhi; Girija Sankar Rath
International Journal of Signal and Imaging Systems Engineering (IJSISE), Vol. 6, No. 1, 2013

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.

Online publication date: Sun, 20-Jan-2013

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Signal and Imaging Systems Engineering (IJSISE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com