By Topic

Invertible, Involutory and Permutation Matrix Generation Methods for Hill Cipher System

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Bibhudendra Acharya ; Dept. of Electron. & Commun. Eng., Nat. Inst. of Technol. Rourkela, Rourkela ; Debasish Jena ; Sarat Kumar Patra ; Ganapati Panda

Hill cipher's susceptibility to cryptanalysis has rendered it unusable in practice, it still serves an important pedagogical role in both cryptology and linear algebra. Hill cipher requires inverse of the key matrix while decryption. In fact that not all the matrices have an inverse and therefore they will not be eligible as key matrices in the Hill cipher scheme. Furthermore, due to its linear nature, the basic Hill cipher succumbs to known-plaintext attacks. In order to repair these flaws of the original Hill cipher, in this paper we proposed Invertible, involutory and permutation matrix generation methods for Hill cipher system.

Published in:

Advanced Computer Control, 2009. ICACC '09. International Conference on

Date of Conference:

22-24 Jan. 2009