A Study of Z-Transform Based Encryption Algorithm

Authors

  • Mohammed N. Alenezi Computer Science and Information Systems Department The Public Authority for Applied Education & Training https://orcid.org/0000-0002-3497-0860
  • Fawaz S. Al-Anzi Computer Engineering Department Kuwait University

DOI:

https://doi.org/10.17762/ijcnis.v13i2.5052

Abstract

It has become increasingly important to ensure the protection of information, especially data in transit. Therefore, it is the primary goal of any encryption algorithm to safeguard the protection of information against security attacks. It is equally important to design high-performance solutions with affordable cost of implementation. Encryption algorithms are used to transform plain text to the ciphertext in order to protect privacy, prevent data fraud, and prevent unauthorized access of data in daily transactions. There are multiple types of encryption algorithms, each with its niche tactics to enhance security. For instance, different kinds of algorithms include but are not limited to the following: Blowfish, RSA, AES, DES, Triple DES. This paper contributes an efficient and secure encryption algorithm technique for information security based on Z transformation and XOR function known as the Z Transformation Encryption (ZTE) technique. To elaborate, this technique implements concepts of Z transformation and XOR operations at the source. The reverse process is applied at the receiving end of the transaction wherein the inverse of Z transformation and XOR is applied to reveal the original plain text message. The simulation of the proposed algorithm is conducted using the R language. The results show a promising performance comparing to other symmetric algorithms.

Downloads

Published

2021-08-26 — Updated on 2022-04-15

Versions

How to Cite

Alenezi, M. N., & Al-Anzi, F. S. (2022). A Study of Z-Transform Based Encryption Algorithm. International Journal of Communication Networks and Information Security (IJCNIS), 13(2). https://doi.org/10.17762/ijcnis.v13i2.5052 (Original work published August 26, 2021)

Issue

Section

Research Articles