Please use this identifier to cite or link to this item: http://148.72.244.84/xmlui/handle/xmlui/15794
Title: Generating Self-Invertible Matrices by Hill Cipher Algorithm In Gaussian Integers
Authors: Ayat A. Jafaar
Rifaat Z. Khalaf
Keywords: Hill Cipher (HC), self-reflexive matrix, Gaussian Integers, Euclidean Algorithm.
Issue Date: 1-Jan-2024
Publisher: university of Diyala
Abstract: In this paper, the Creating self-reflexive matrices for the Hill Cipher algorithm in Gaussian integers is discussed. It's not always possible to find the inverse of the matrix that was used to encrypt the plaintext. Therefore, the encrypted text cannot be deciphered if the matrix is not invertible. The encryption matrix utilized in the self-reflexive matrix Creating method is selfreflexive as well. As a result, we do not need to find the matrix's inverse during decryption. Additionally, this approach does away with the computational cost of determining the matrix's inverse during decryption. We also provided an example showing the work of Hill-Cipher using a self-reflecting matrix in Gaussian integers.
URI: http://148.72.244.84/xmlui/handle/xmlui/15794
ISSN: 2958-4612
Appears in Collections:مجلة ديالى للعلوم الاكاديمية / Academic Science Journal (Acad. Sci. J.)

Files in This Item:
File Description SizeFormat 
8-701ok.pdf1.26 MBAdobe PDFView/Open


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