Tesseract encryption algorithm using latin square of order 8 (TEA-o8)

Authors

  • Azahari SRBM Faculty of Science and Information Technology, Universiti Tun Hussein Onn Malaysia (UTHM), 86400, Parit Raja, Johor, Malaysia
  • Jamel S Faculty of Science and Information Technology, Universiti Tun Hussein Onn Malaysia (UTHM), 86400, Parit Raja, Johor, Malaysia
  • Mushtaq MF Department of Information Technology, Khwaja Fareed University of Engineering and Information Technology, Rahim Yar Khan 64200, Pakistan
  • Khalid SKA Faculty of Science and Information Technology, Universiti Tun Hussein Onn Malaysia (UTHM), 86400, Parit Raja, Johor, Malaysia
  • Mohamad KM Faculty of Science and Information Technology, Universiti Tun Hussein Onn Malaysia (UTHM), 86400, Parit Raja, Johor, Malaysia
  • Deris MM Faculty of Science and Information Technology, Universiti Tun Hussein Onn Malaysia (UTHM), 86400, Parit Raja, Johor, Malaysia

Keywords:

Latin Square of Order 8, Tesseract, 3D-Hybrid Cubes, HiSea, KSA

Abstract

In this paper, we investigate the possibility of extending Latin Square of Order 4 in Hybrid Cube Encryption Algorithm (HiSea) and Three-Dimensional Hybrid Cubes Encryption (3D-HiSea) algorithm using Latin square of order 8. The objective of this research is to investigate the security improvement of key provided in current algorithm using FourDimensional (4D) concept. Entries of Latin square of order 8 are used as a method extended to form a 4D Hybrid Cubes or Tesseract (TEA-08). The existence of 108 quintillion LS of order 8 (LS8) open up new possibilities for increasing possible key space for 3D-HiSea. New tesseract structure based on 8 3D-Hybrid Cube has been successfully implemented using LS order 8. Master Key generated from HiSea, 3D HiSea and Tesseract is used to study its security analysis using Entropy Test. Next, Frequency, Block Frequency and Run Test analysis is perform using NIST Testing Tool to investigate the security of ciphertext produced. The results show that entropy for TEA-08 master key is 0.9961 more closer to 1. Furthermore, ciphertext security analysis resultant the P-Value of Frequency is 0.328363, Block Frequency is 0.488475 and Run Test is 0.457713 which greater than 0.01 prove that algorithm proposed are random. Thus, based on the findings TEA-O8 it can be concluded that the key and ciphertext generated is random and can be evaluated further to include other security analysis testing tool and method which suitable for non-binary block cipher.

References

V. K. Pachghare, Cryptography and Information Security. Delhi: PHI Learning Private Limited, 2015.

M. Rouse, “confidentiality, integrity, and availability (CIA triad).” 2014.[Online]. Available:https://whatis.techtarget.com/definition/Confidentialityintegrity-and-availability-CIA. [Accessed: 20-April-2018]

J. Callas, “An Introduction to Cryptography,” 5,214,703, 2008.

C. Paar and J. Pelzl, Understanding Cryptography, vol. 1. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010.

T. Baign, J. Stern, and S. Vaudenay, “Linear Cryptanalysis of Non Binary Ciphers ( With an Application to SAFER ),” Proc. 14th Int. Conf. Sel. areas Cryptogr., pp. 184–211, 2007.

S. Jamel, M. M. Deris, I. Tri, R. Yanto, and T. Herawan, “HiSea : A Non Binary Toy Cipher,” J. Comput., vol. 3, no. 6, pp. 20–27, 2011.

M. F. Mushtaq, S. Jamel, S. Radhiah, U. Akram, and M. Mat, “Key Schedule Algorithm using 3-Dimensional Hybrid Cubes for Block Cipher,” Int. J. Adv. Comput. Sci. Appl., vol. 10, no. 8, 2019.

S. K. A. Khalid, M. M. Deris, and K. M. Mohamad, “A Systematic Redudancy Approach in Watermarking Using Soduku,” in International Conference on IT Convergence and Security (ICITCS), 2014.

M. F. Mushtaq, S. Jamel, and M. M. Deris, “Triangular Coordinate Extraction (TCE) for hybrid cubes,” Journal of Engineering and Applied Sciences, vol. 12, no. 8. pp. 2164–2169, 2017.

M. F. Mushtaq, S. Jamel, K. M. Mohamad, S. K. A. Kamal, and M. M. Deris, “Key Generation Technique based on Triangular Coordinate Extraction for Hybrid Cubes,” J. Telecommun. Electron. Comput. Eng., vol. 9, no. 3–4, pp. 195–200, 2017.

Y. Ren, F. Liu, T. Guo, R. Feng, and D. Lin, “Cheating prevention visual cryptography scheme using Latin square,” IET Inf. Secur., vol. 11, no. 4, pp. 211-219(8), Jul. 2017.

S. Jamel, M. M. Deris, I. T. R. Yanto, and T. Herawan, “The Hybrid Cubes Encryption Algorithm (HiSea),” in Advances in Wireless, Mobile Networks and Applications, 2011, pp. 191–200.

P. R. Kumar, K. L. Sailaja, S. S. Dhenakaran, and P. SaiKishore, “Chakra: A new approach for symmetric key encryption,” in 2012 World Congress on Information and Communication Technologies, 2012, pp. 727–732.

J. Khurana, R. Chaudhary, A. Arora, S. Kapoor, and S. K. Pal, “Design of strong cryptographic schemes based on Latin Squares,” J. Discret. Math. Sci. Cryptogr., vol. 13, no. 3, pp. 233–256, 2013.

S. K. Pal, D. Bhardwaj, R. Kumar, and V. Bhatia, “A New Cryptographic Hash Function based on Latin Squares and Nonlinear Transformations,” in 2009 IEEE International Advance Computing Conference, 2009, pp. 862–867.

Y. Wu, Y. Zhou, J. Noonan, and C. Chen, “A Novel Latin Square Image Cipher,” 2012.

G. Kolesova, C. W. . Lam, and L. Thiel, “On the number of 8×8 latin squares,” J. Comb. Theory, Ser. A, vol. 54, no. 1, pp. 143–148, May 1990.

M. Trenkler, “A Construction of Magic Cubes,” Math. Gaz., vol. 84, no. 499, pp. 36–41, 2000.

J. Constant, “The Fourth Dimension in Mathematics and Art,” in Proceedings of Bridges 2016: Mathematics, Music, Art, Architecture, Education, Culture, 2016, pp. 541–544.

F. Buekenhout and M. Parker, “The number of nets of the regular convex polytopes in dimension <= 4,” Discrete Math., vol. 186, pp.

–94, 1998.

B. L. Chilton, “The Stellated Forms of the Sixteen-Cell,” Am. Math. Mon., vol. 74, no. 4, pp. 372–378, 1967.

J. Constant, “The Fourth Dimension in Mathematics and Art,” Proc. Bridg. 2016 Math. Music. Art, Archit. Educ. Cult., pp. 541– 544, 2016.

K. Nayyeri and S. Gartner, “Latin Square Generator Tool,” 2012. [Online]. Available: https://github.com/keyvan/LatinSquaresGenerator.

A. M. Atteya and A. H. Madian, “A hybrid Chaos-AES encryption algorithm and its impelmention based on FPGA,” 2014 IEEE 12th Int. New Circuits Syst. Conf. NEWCAS 2014, pp. 217–220, 2014.

A. L. Rukhin et al., “A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications,” National Institute of Standards and Technology (NIST) Special Publication 800-22, Rev. 1a, 2010. [Online]. Available: https://www.nist.gov/publications/statistical-test-suiterandom-and-pseudorandom-number-generators-cryptographic. [Accessed: 28-Sep-2019].

Downloads

Published

2024-02-26

How to Cite

Azahari, S. R. B. M., Jamel, S., Mushtaq, M. F., Khalid, S. K. A., Mohamad, K. M., & Deris, M. M. (2024). Tesseract encryption algorithm using latin square of order 8 (TEA-o8). COMPUSOFT: An International Journal of Advanced Computer Technology, 9(04), 3617–3623. Retrieved from https://ijact.in/index.php/j/article/view/561

Issue

Section

Original Research Article

Similar Articles

<< < 2 3 4 5 6 7 8 > >> 

You may also start an advanced similarity search for this article.