International Peer-Reviewed JournalOpen AccessISSN 2456-8880
irejournals@gmail.com+91-7433024337

Home / Current Issue / Paper 1722723

1722723 Vol 10 · Issue 2 Download Paper

Development of a Secure Triple Data Encryption Algorithm (TDESA) Using a Key-Dependent Double XOR Transformation

S. F. Ilo Nnamdi H. I. Nwanebu O. T.

Subject area: Science,Engineering and Technology  ·  Area of research: Computer Engineering and Security

DOI: https://doi.org/10.64388/IREV10I2-1722723

Abstract

The rapid expansion of digital communication infrastructure has intensified the demand for encryption algorithms that are simultaneously efficient and resistant to modern cryptanalytic techniques. Conventional symmetric cryptographic systems, including the Data Encryption Standard (DES) and its triple-application successor (3DES), continue to face challenges related to computational overhead and diminishing resistance against brute-force and statistical attacks as computing power increases. This study presents an improved Secure Triple Data Encryption Algorithm (TDESA) that embeds a key-dependent double transformation layer, comprising a bitwise Exclusive-OR (XOR) operation followed by a key-controlled cyclic rotation and a second XOR operation, between two full encryption stages. Unlike a naive double-XOR construction, in which two successive XOR operations with fixed keys collapse algebraically into a single XOR and therefore add no security, the rotation-dependent design proposed here breaks this linearity and ensures that the intermediate transformation cannot be reduced to an equivalent single-key operation. The mathematical structure, algorithmic procedure, and system architecture of the proposed model are presented in detail, together with a security justification of the redesigned transformation layer. The algorithm was implemented and evaluated in MATLAB R2023b using plaintext samples of 1 KB, 10 KB, 100 KB, 500 KB, and 1 MB, with encryption time, decryption time, memory utilisation, and avalanche effect measured against DES, 3DES, and AES-128 baselines. Results indicate that the proposed TDESA achieves an average encryption time of approximately 34.0 milliseconds for a 1 MB file, positioning it between AES-128 (29.1 ms) and 3DES (60.2 ms), while exhibiting an avalanche effect of approximately 51.2 percent, comparable to AES. The proposed model is suitable for secure communication systems, cloud computing environments, and resource-constrained Internet-of-Things (IoT) applications where a balance between confidentiality strength and computational economy is required.

Keywords

symmetric cryptography; triple data encryption standard; key-dependent xor transformation; cyclic rotation; cryptographic diffusion; internet of things security.

References

[1] AES Security Improvement by Utilizing New Key-Dependent XOR Tables (2024). IEEE Access, 12, 1–12. https://doi.org/10.1109/ACCESS.2024.3387268

[2] Alkhonaini, M., Gemeay, E., & Mahmood, F. (2024). Image encryption using chaotic maps and cellular automata. Scientific Reports, 14, Article 18342. https://doi.org/10.1038/s41598-024-68900-1

[3] Almuhammadi, S., & Al-Hejri, I. (2017). A comparative analysis of AES common modes of operation. 2017 IEEE 30th Canadian Conference on Electrical and Computer Engineering (CCECE), 1–4. https://doi.org/10.1109/CCECE.2017.7946655

[4] Barker, E., & Mouha, N. (2017). Recommendation for the Triple Data Encryption Algorithm (TDEA) block cipher (NIST Special Publication 800-67, Revision 2). National Institute of Standards and Technology. https://doi.org/10.6028/NIST.SP.800-67r2

[5] Comparative Analysis of AES, RSA, and 3DES Encryption Standards based on Speed and Performance (2024). International Journal of Engineering Research and Technology, 13(4), 112–120.

[6] Hoang, D. L., & Luong, T. T. (2024). Enhancing block cipher security with key-dependent random XOR tables generated via Hadamard matrices and Sudoku game. Journal of Intelligent & Fuzzy Systems, 46(3), 6791–6805. https://doi.org/10.3233/JIFS-236998

[7] Kumar, S., Kulkarni, N., & Verma, V. (2024). Chaos-driven encryption for IoT image security. Journal of Information Systems Research and Practice, 2(1), 45–59.

[8] Lizama-Perez, L. A. (2023). XOR chain and perfect secrecy in cryptographic systems. Cryptography, 7(3), 38. https://doi.org/10.3390/cryptography7030038

[9] Mohamud, A. H. (2024). A new mathematical model to improve encryption using SRFFT algorithm. Frontiers in Computer Science, 6, Article 1377024. https://doi.org/10.3389/fcomp.2024.1377024

[10] Mushtaq, M. F., Jamel, S., Disina, A. H., Pindar, Z. A., Shakir, N. S. A., & Deris, M. M. (2017). A survey on the cryptographic encryption algorithms. International Journal of Advanced Computer Science and Applications, 8(11), 333–344. https://doi.org/10.14569/IJACSA.2017.081141

[11] Nazarenko, E., Anagnostopoulos, N., & Stavrinides, S. (2022). Real-world chaos-based cryptography using synchronized chaotic circuits. Nonlinear Dynamics, 110, 1331–1354. https://doi.org/10.1007/s11071-022-07675-7

[12] Noura, H. N., Salman, O., & Chehab, A. (2023). Conception of efficient key-dependent binary diffusion matrix structures for dynamic cryptographic algorithms. Journal of Information Security and Applications, 76, 103514. https://doi.org/10.1016/j.jisa.2023.103514

[13] Ozer, E., & Aydos, H. (2024). Performance and security of AES, DES, and RSA in triple encryption systems. International Journal of Computational and Experimental Science and Engineering, 10(3), 412–421. https://doi.org/10.22399/ijcesen.456

[14] Paar, C., & Pelzl, J. (2010). Understanding Cryptography: A Textbook for Students and Practitioners. Springer-Verlag. https://doi.org/10.1007/978-3-642-04101-3

[15] Splunk (2023). The Twofish encryption algorithm. Splunk Learn. Retrieved from https://www.splunk.com/en_us/blog/learn/twofish-encryption-algorithm.html

[16] Stallings, W. (2017). Cryptography and Network Security: Principles and Practice (7th ed.). Pearson Education.

[17] Tutorialspoint (2023). Cryptography – AddRoundKey transformation. Retrieved from https://www.tutorialspoint.com/cryptography/cryptography_addroundkey_transformation.htm

How to cite this paper

S. F. Ilo, Nnamdi H. I., Nwanebu O. T. "Development of a Secure Triple Data Encryption Algorithm (TDESA) Using a Key-Dependent Double XOR Transformation" Iconic Research And Engineering Journals Volume 10 Issue 2 2026 Page 3601-3612 https://doi.org/10.64388/IREV10I2-1722723
S. F. Ilo, Nnamdi H. I., Nwanebu O. T. "Development of a Secure Triple Data Encryption Algorithm (TDESA) Using a Key-Dependent Double XOR Transformation" Iconic Research And Engineering Journals, vol. 10, no. 2, Aug. 2026, doi: https://doi.org/10.64388/IREV10I2-1722723
S. F. Ilo, Nnamdi H. I., Nwanebu O. T. (2026). Development of a Secure Triple Data Encryption Algorithm (TDESA) Using a Key-Dependent Double XOR Transformation. Iconic Research And Engineering Journals, 10(2). doi: https://doi.org/10.64388/IREV10I2-1722723
S. F. Ilo, Nnamdi H. I., Nwanebu O. T. "Development of a Secure Triple Data Encryption Algorithm (TDESA) Using a Key-Dependent Double XOR Transformation" Iconic Research And Engineering Journals, vol. 10, no. 2, Aug. 2026. Crossref, https://doi.org/10.64388/IREV10I2-1722723
@article{1722723,
      author = {S. F. Ilo, Nnamdi H. I., Nwanebu O. T.},
      title = {Development of a Secure Triple Data Encryption Algorithm (TDESA) Using a Key-Dependent Double XOR Transformation},
      journal = {Iconic Research And Engineering Journals},
      year = {2026},
      volume = {10},
      number = {2},
      pages = {3601-3612},
      issn = {2456-8880},
      url = {https://www.irejournals.com/formatedpaper/1722723.pdf},
      abstract = {The rapid expansion of digital communication infrastructure has intensified the demand for encryption algorithms that are simultaneously efficient and resistant to modern cryptanalytic techniques. Conventional symmetric cryptographic systems, including the Data Encryption Standard (DES) and its triple-application successor (3DES), continue to face challenges related to computational overhead and diminishing resistance against brute-force and statistical attacks as computing power increases. This study presents an improved Secure Triple Data Encryption Algorithm (TDESA) that embeds a key-dependent double transformation layer, comprising a bitwise Exclusive-OR (XOR) operation followed by a key-controlled cyclic rotation and a second XOR operation, between two full encryption stages. Unlike a naive double-XOR construction, in which two successive XOR operations with fixed keys collapse algebraically into a single XOR and therefore add no security, the rotation-dependent design proposed here breaks this linearity and ensures that the intermediate transformation cannot be reduced to an equivalent single-key operation. The mathematical structure, algorithmic procedure, and system architecture of the proposed model are presented in detail, together with a security justification of the redesigned transformation layer. The algorithm was implemented and evaluated in MATLAB R2023b using plaintext samples of 1 KB, 10 KB, 100 KB, 500 KB, and 1 MB, with encryption time, decryption time, memory utilisation, and avalanche effect measured against DES, 3DES, and AES-128 baselines. Results indicate that the proposed TDESA achieves an average encryption time of approximately 34.0 milliseconds for a 1 MB file, positioning it between AES-128 (29.1 ms) and 3DES (60.2 ms), while exhibiting an avalanche effect of approximately 51.2 percent, comparable to AES. The proposed model is suitable for secure communication systems, cloud computing environments, and resource-constrained Internet-of-Things (IoT) applications where a balance between confidentiality strength and computational economy is required.},
      keywords = {symmetric cryptography; triple data encryption standard; key-dependent xor transformation; cyclic rotation; cryptographic diffusion; internet of things security.},
      month = {August},
      doi = {https://doi.org/10.64388/IREV10I2-1722723}
  }