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/930

Full metadata record

DC FieldValueLanguage
contributor.authorAcharya, B-
contributor.authorJena, D-
contributor.authorPatra, S K-
contributor.authorPanda, G-
identifier.citationProceedings of International Conference on Advanced Computer Control, ICACC-09, Jan 22-24, 2009, Singapore, P 246-249en
descriptionCopyright belongs to Proceedings Publisher IEEEen
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
format.extent337329 bytes-
subjectHii Cipheren
subjectInvolutory Matrixen
titleInvertible, Involutory and Permutation Matrix Generation Methods for Hill Cipher Systemen
Appears in Collections:Conference Papers

Files in This Item:

File Description SizeFormat
Proceedings_2_ICACC_09.pdf329KbAdobe PDFView/Open

Show simple item record

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


Powered by DSpace Feedback