List of Journals    /    Call For Papers    /    Subscriptions    /    Login
 
 
 
 
 SEARCH
By Author By Title
 
 
ABOUT CSC
 About CSC Journals
 CSC Journals Objectives
 List of Journals
 CALL FOR PAPERS
 Call For Papers CFP
 Special Issue CFP
AUTHOR GUIDELINES
 Submission Guidelines
 Peer Review Process
 Helpful Hints For Getting Published
 Plagiarism Policies
 Abstracting & Indexing
 Open Access Policy
 Submit Manuscript
 FOR REVIEWERS
 Reviewer Guidelines
 FOR EDITORIAL
 Editor Guidelines
 Join Us As Editor
 Launch Special Issue
 Suggest New Journal
 CSC LIBRARY
 Browse CSC Library
 Open Access Policy
  SERVICES
 Conference Partnership Program (CPP)
 Abstracting & Indexing
 SUBSCRIPTIONS
 Subscriptions
 Discounted Packages
 Archival Subscriptions
 How to Subscribe
 Librarians
 Subscriptions Agents
 Order Form
 DOWNLOADS
 
 
 
 
Novel Methods of Generating Self-Invertible Matrix for Hill Cipher Algorithm.
Full text
 PDF(89.2KB)
Source 
International Journal of Security (IJS)
Table of Contents
Download Complete Issue    PDF(1.93MB)
Volume:  1    Issue:  1
Pages:  1-44
Publication Date:   June 2007
ISSN (Online): 1985-2320
Pages 
14 - 21
Author(s)  
 
Published Date   
 
Publisher 
CSC Journals, Kuala Lumpur, Malaysia
ADDITIONAL INFORMATION
Keywords   Abstract   References   Cited by   Related Articles   Collaborative Colleague
 
KEYWORDS:   Hill Cipher, Encryption, Decryption, Self-invertible matrix. 
 
 
This Manuscript is indexed in the following databases/websites:-
1. Directory of Open Access Journals (DOAJ)
2. Docstoc
3. Scribd
4. PDFCAST
5. CiteSeerX
6. Google Scholar
7. WorldCat
8. ScientificCommons
9. Academic Index
10. refSeek
11. ResearchGATE
12. Bielefeld Academic Search Engine (BASE)
13. Socol@r
14. iSEEK
15. Microsoft Academic Search
 
 
In this paper, methods of generating self-invertible matrix for Hill Cipher algorithm have been proposed. The inverse of the matrix used for encrypting the plaintext does not always exist. So, if the matrix is not invertible, the encrypted text cannot be decrypted. In the self-invertible matrix generation method, the matrix used for the encryption is itself self-invertible. So, at the time of decryption, we need not to find inverse of the matrix. Moreover, this method eliminates the computational complexity involved in finding inverse of the matrix while decryption. 
 
 
 
1 Blakley G.R., “Twenty years of cryptography in the open literature”, Security and Privacy 1999, Proceedings of the IEEE Symposium, 9-12 May 1999
2 Imai H., Hanaoka G., Shikata J., Otsuka A., Nascimento A.C., “Cyptography with Information Theoretic Security”, Information Theory Workshop, 2002, Proceedings of the IEEE, 20-25 Oct 2002
3 A. J. Menezes, P.C. Van Oorschot, S.A. Van Stone, “Handbook of Applied Cryptography”, CRC press, 1996
4 W. Stallings, “Cryptography and Network Security”, 4th edition, Prentice Hall, 2005
5 Bruce Schneir, “Applied Cryptography”, 2nd edition, John Wiley & Sons, 1996
 
 
 
 
 
 
 
 
Bibhudendra Acharya : Colleagues
Girija Sankar Rath : Colleagues
Sarat Kumar Patra : Colleagues
Saroj Kumar Panigrahy : Colleagues  
 
 
 
  Untitled Document
 
Copyrights (c) 2012 Computer Science Journals. All rights reserved.
Best viewed at 1152 x 864 resolution. Microsoft Internet Explorer.
 
  
 
Copyrights & Usage: Articles published by CSC Journals are Open Access. Permission to copy and distribute any other content, images, animation and other parts of this website is prohibited. CSC Journals has the rights to take action against individual/group if they are found victim of copying these parts of the website.