Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/930
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAcharya, B-
dc.contributor.authorJena, D-
dc.contributor.authorPatra, S K-
dc.contributor.authorPanda, G-
dc.date.accessioned2009-07-27T02:27:50Z-
dc.date.available2009-07-27T02:27:50Z-
dc.date.issued2009-01-
dc.identifier.citationProceedings of International Conference on Advanced Computer Control, ICACC-09, Jan 22-24, 2009, Singapore, P 246-249en
dc.identifier.isbn978-0-7695-3516-6/08-
dc.identifier.urihttp://doi.ieeecomputersociety.org/10.1109/ICACC.2009.101-
dc.identifier.urihttp://hdl.handle.net/2080/930-
dc.descriptionCopyright belongs to Proceedings Publisher IEEEen
dc.description.abstractHill 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.en
dc.format.extent337329 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.publisherIEEEen
dc.subjectHii Cipheren
dc.subjectInvolutory Matrixen
dc.titleInvertible, Involutory and Permutation Matrix Generation Methods for Hill Cipher Systemen
dc.typeArticleen
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
Proceedings_2_ICACC_09.pdf329.42 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.