DSpace@nitr >
National Institue of Technology- Rourkela >
Conference Papers >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/1191

Full metadata record

DC FieldValueLanguage
contributor.authorAchaya, B-
contributor.authorShukla, S K-
contributor.authorPanigrahy, S K-
contributor.authorPatra, S K-
contributor.authorPanda, G-
date.accessioned2010-03-08T10:50:49Z-
date.available2010-03-08T10:50:49Z-
date.issued2009-12-
identifier.citationProceedings of the International Conference on Advances in Computing, Control, and Telecommunication Technologies (ACT-2009), December 28-29, 2009, Trivandrum, India, P. 720-724en
identifier.isbn978-0-7695-3915-7-
identifier.urihttp://dx.doi.org/10.1109/ACT.2009.183-
identifier.urihttp://hdl.handle.net/2080/1191-
descriptionCopyright for the article belongs to proceedings publisher IEEEen
description.abstractAbstract—Information security is an important issue. Today’s encryption technologies can be traced back to the earliest ciphers, and have grown as a result of evolution. The first ciphers were cracked, so new, stronger ciphers emerged. Code breakers set to work on these and eventually found flaws, forcing cryptographers to invent better ciphers and so on. Hill Cipher is one of the most famous symmetric cryptosystem that can be used to protect information from unauthorized access. Hill cipher is a polygraph substitution cipher based on linear algebra. it was the first polygraph cipher which was practical to operate on more than three symbols at once, Hill Cipher has many advantages in data encryption. First, it is resistant to the frequency letter analysis. It's also very simple since it uses matrix multiplication. Finally, it has high speed and high throughput. However, noninvertible key matrix over Zm is the main disadvantage of Hill Cipher, because few of the matrices have inverses over Zm . This means that the encrypted text can't be decrypted. Moreover, Hill cipher algorithm cannot encrypt images that contain large areas of a single color. Thus, it does not hide all features of the image which reveals patterns in the plaintext. Moreover, it can be easily broken with a known plaintext attack revealing weak security. The objective of this paper is to encrypt an image using a technique different from the conventional one. In this paper, a novel encryption technique has been proposed which we name H-S-X (Hill-Shift-XOR) encryption. The scheme is relatively slow but quite reliable technique where cryptanalysis is quite difficult. It also injects more diffusion and confusion which are the two important attributes of a powerful encryption technique. A comparative study of the proposed encryption scheme and the existing Hill cipher scheme is made. The output encrypted images reveal that the proposed technique is quite reliable and robust.en
format.extent428716 bytes-
format.mimetypeapplication/pdf-
language.isoen-
publisherIEEE CSen
relation.ispartofseriesIEEE Proceedings;-
subjectCryptosystemen
subjectEncryptionen
subjectDecryptionen
subjectHill Cipheren
titleH-S-X Cryptosystem and Its Application to Image Encryptionen
typeArticleen
Appears in Collections:Conference Papers

Files in This Item:

File Description SizeFormat
HSX-ACT-2009.pdf418KbAdobe PDFView/Open

Show simple item record

All items in DSpace are protected by copyright, with all rights reserved.

 

Powered by DSpace Feedback