The International Arab Journal of Information Technology (IAJIT)


A Highly Parallelizable Hash Algorithm Based on Latin Cubes

Ming Xu,

Latin cubes are the high-dimensional form of Latin squares. Latin cubes have discreteness, uniformity and 3D attribute. There have been some applications of Latin squares in hash algorithms, but few applications of Latin cubes in this field. In this paper, a highly parallelizable hash algorithm based on four Latin cubes of order 4 is proposed. The parallelism is reflected in two aspects: on the one hand, the whole message is divided into several blocks, and all the blocks are processed in parallel; on the other hand, each block is further divided into several channels, and these channels are also processed in parallel. The whole hash procedure is based on four fixed Latin cubes. By the aid of uniformity and 3D attribute of Latin cubes, the algorithm has good statistical performances and strong collision resistance. Furthermore, the parallel structure makes the algorithm have satisfactory computation speed. Therefore the algorithm is quite suitable for the current applications of communication security.

[1] Aumasson J., Henzen L., Meier W., and Phan R., SHA-3 Proposal BLAKE, NIST, 2008. hash_atmel/specs/blake.pdf

[2] Bertoni G., Daemen J., Peeters M., and Assche G., Keer R., Keccak Implementation Overview, NIST, 2012. implementation-3.2.pdf,

[3] Bertoni G., Daemen J., Peeters M., and Assche G., Cryptographic Sponge Functions, NIST, 2011.

[4] Biham E. and Dunkelman O., “A Framework for Iterative Hash Functions-HAIFA,” The 2nd NIST Hash Workshop, 2006. UNKELMAN_talk.pdf

[5] Chenaghlu M., Jamali S., and Khasmakhi N., “A Novel Keyed Parallel Hashing Scheme Based on a New Chaotic System,” Chaos, Solitons and Fractals, vol. 87, pp. 216-225, 2016. DOI:10.1016/j.chaos.2016.04.007

[6] Gauravaram P., Knudsen L.., Matusiewicz K., Mendel F., and Rechberger C., Groestl-a SHA-3 Candidate, NIST, 2011.

[7] Ghosh R., Verma S., Kumar R., Kumar S., and Ram S., “Design of Hash Algorithm Using Latin Square,” Procedia Computer Science, vol. 46, pp. 759-765, 2015.

[8] Huang Z., “A More Secure Parallel Keyed Hash Function Based on Chaotic Neural Network,” Communications in Nonlinear Science and Numerical Simulation, vol. 16, no. 8, pp. 3245- 3256, 2011.

[9] Kocarev L. and Lian S., Chaos-Based Cryptography: Theory, Algorithm and Applications, Springer, 2011. 642-20542-2

[10] Li Y., Deng S., and Xiao D., “A Novel Hash Algorithm Construction Based on Chaotic Neural Network,” Neural Computing and Applications, vol. 20, pp. 133-141, 2011. DOI:

[11] Li Z. and Yang Y., Programming Implement for Typical Cryptographic Algorithms, National Defense Industry Press, 2013.

[12] Li Y. and Ge G., “Cryptographic and Parallel Hash Function Based on cross Coupled Map Lattices Suitable for Multimedia Communication Security,” Multimedia Tools and Applications, vol. 78, pp. 17973-17994, 2019.

[13] Li Y., Ge G., and Xia D., “Chaotic Hash Function Based on the Dynamic S-Box with Variable Parameters,” Nonlinear Dynamics, vol. 84, no. 4, pp. 2387-2402, 2016. DOI: 10.1007/s11071-016- 2652-1

[14] Mullen G. and Weber R., “Latin Cubes of Order ≤ 5,” Discrete Mathematics, vol. 32, no. 3, pp. 291- 297, 1980. 365X(80)90267-8

[15] NIST, “Secure Hash Standard,”, Last Visited, 2023.

[16] Rivest R., “The MD4 Message-Digest Algorithm,” LNCS, vol. 537, pp. 303-311, 1991.

[17] Shannon C., “Communication Theory of Secrecy Systems,” Bell System Technical Journal, vol. 28, pp. 656-715, 1949.

[18] Slaminková I. and Vojvoda M., “Cryptanalysis of a Hash Function Based on Isotopy of Quasigroups,” Tatra Mountains Mathematical Publications, vol. 45, no. 1, pp. 137-149, 2010. DOI:

[19] Snasel V., Abraham A., Dvorský J., Kromer P., and Platoš J., “Hash Functions Based on Large Quasigroups,” in Proceedings of the Computational Science: 9th International Conference Baton Rouge, Los Angeles, pp. 521- 529, 2009. DOI: 642-01970-8_51

[20] Teh J., Samsudin A., and Masoumi A., “Parallel Chaotic Hash Function Based on the Shuffle- Exchange Network,” Nonlinear Dynamics, vol. 81, no. 3, pp. 1067-1079, 2015. DOI:10.1007/s11071- 015-2049-6

[21] Wang S., Li D., and Zhou H., “Collision Analysis of a Chaos-Based Hash Function with both Modification Detection and Localization Capability,” Communications in Nonlinear Science and Numerical Simulation, vol. 17, no. 2, pp. 780-784, 2012.

[22] Wang Y., Wong K., and Xiao D., “Parallel Hash Function Construction Based on Coupled Map Lattices,” Communications in Nonlinear Science and Numerical Simulation, vol. 16, no. 7, pp. 2810-2821, 2011.

[23] Wu H., The Hash Function JH1, NIST, 2011. h/jh/jh_round3.pdf. 2011.

[24] Xiao D., Peng W., Liao X., and Xiang T., “Collision Analysis of One Kind of Chaos-Based Hash Function,” Physics Letters A, vol. 374, no. A Highly Parallelizable Hash Algorithm Based on Latin Cubes 945 = 10, pp. 1228-1231, 2010.

[25] Xu M., “A New Chaos-Based Image Encryption Algorithm,” The International Arab Journal of Information Technology, vol. 15, no. 3, pp. 493- 498, 2018. 0No.%203/11035.pdf

[26] Zhang P., Zhang X., and Yu J., “A Parallel Hash Function with Variable Initial Values,” Wireless Personal Communications: An International Journal, vol. 96, no. 2, pp. 2289-2303, 2017. Ming Xu female, Born in China, 1981; PhD in Applied Mathematics, Hebei Normal University, Shijiazhuang, China, the degree was earned in 2019; The main research field: Cryptography.