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...
Saved in:
| Published in: | Academic Science Journal Vol. 2; no. 1; pp. 108 - 122 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
College of science, university of Diyala
01.01.2024
|
| Subjects: | |
| ISSN: | 2958-4612, 2959-5568 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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 |