Generating Self-Invertible Matrices by Hill Cipher Algorithm In Gaussian Integers

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 inverti...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Academic Science Journal Jg. 2; H. 1; S. 108 - 122
1. Verfasser:	A. Jafaar, Ayat
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	College of science, university of Diyala 01.01.2024
Schlagworte:	Hill Cipher (HC), self-reflexive matrix, Gaussian Integers, Euclidean Algorithm
ISSN:	2958-4612, 2959-5568
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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 self-reflexive 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
ISSN:	2958-4612 2959-5568
DOI:	10.24237/ASJ.02.01.701B