Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
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.
International Journal of Signal and Imaging Systems Engineering – Inderscience Publishers
Published: Jan 1, 2013
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.