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 invert...
Saved in:
| Main Authors: | Ayat A. Jafaar, Rifaat Z. Khalaf |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
College of science, university of Diyala
2024-01-01
|
| Series: | Academic Science Journal |
| Subjects: | |
| Online Access: | https://acadscij.uodiyala.edu.iq/index.php/Home/article/view/342 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Perfect Gaussian Integer Sequences With Two Cycles
by: Kun-Lin Lee, et al.
Published: (2025-01-01) -
Combining Several Substitution Cipher Algorithms using Circular Queue Data Structure
by: Noor Ibraheem, et al.
Published: (2020-12-01) -
Apply Block Ciphers Using Tiny Encryption Algorithm (TEA)
by: Hana Rashied Ismaeel
Published: (2010-06-01) -
A New Cipher Based on Feistel Structure and Chaotic Maps
by: Al-Bahrani et al.
Published: (2019-03-01) -
Parallel lightweight Block Cipher algorithm for Multicore CPUs
by: Hawraa J. Hamiza, et al.
Published: (2024-10-01)