Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

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

Encryption by Hill cipher and by a novel method using Chinese remainder theorem in Galois field 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Signal and Imaging Systems Engineering Inderscience Publishers

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

Loading next page...
 
/lp/inderscience-publishers/encryption-by-hill-cipher-and-by-a-novel-method-using-chinese-ayPf0yu71y

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Inderscience Publishers
Copyright
Copyright © Inderscience Enterprises Ltd. All rights reserved
ISSN
1748-0698
eISSN
1748-0701
DOI
10.1504/IJSISE.2013.051508
Publisher site
See Article on Publisher Site

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.

Journal

International Journal of Signal and Imaging Systems EngineeringInderscience Publishers

Published: Jan 1, 2013

There are no references for this article.