Article Sidebar

Download
PDF
Statistic
Read Counter : 0 Download : 0

Main Article Content

Abstract

A mathematical hash function maps inputs of arbitrary length to unique outputs (digests) of a fixed length. It is highly useful and used in almost all information security applications; it can also serve as index data in hash tables, detect duplicate data for fingerprinting or uniquely identifying files, and serve as well for checksums to identify data corruption. In this work, a novel 256-bit cryptographic hash function based on the irreversible Mealy finite automata model (IFA) is introduced. In this architecture, the irreversible transition matrix of the Mealy automaton (IFA) is constructed using a non-injective state-transition mechanism to introduce local irreversibility and ambiguous backward reconstruction. The automaton output table is precomputed using a Chebyshev-based nonlinear generator to improve output randomness and nonlinear complexity. For further diffusion, confusion, collision resistance, and one-wayness improvements, we integrate the irreversible automaton within a sponge-based construction with a 512-bit internal state (256-bit rate + 256-bit capacity), yielding a designed collision resistance of   bits and preimage resistance of  under the sponge capacity bound. Evaluation against SHA-256 shows an avalanche mean of 50.02% (σ = 3.14%), all 13 NIST SP 800-22 statistical tests passed, and zero collisions among 50,000 tests. Throughput is about 13 MB/s versus 183 MB/s for SHA-256, reflecting the sequential dependency of the Mealy transformation.

Keywords

Cryptographic hash function Irreversible automata Avalanche effect Collision resistance Diffusion One-way function

Article Details

How to Cite
Salloom, G., Hassnawi, L., Mohammed, K. ., & Adhab, M. . (2026). A new hash function based on irreversible finite automata. Future Technology, 5(4), 310–319. Retrieved from https://fupubco.com/futech/article/view/1175
Download Citation
Endnote/Zotero/Mendeley (RIS)
BibTeX
Bookmark and Share

References

  1. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone, Handbook of Applied Cryptography. CRC Press, 1996. https://theswissbay.ch/pdf/Gentoomen%20Library/Cryptography/Handbook%20of%20Applied%20Cryptography%20-%20Alfred%20J.%20Menezes.pdf
  2. Federal Information Processing Standards Publication FIPS PUB 180, “Secure Hash Standard”. https://www.wolfssl.com/license/fips/?gad_campaignid=916470942&gad_source=1&gbraid=0AAAAAD_TYV27qymIFqyJcU41eA0W6yfsR
  3. “SHA-3 standard :,” 2015. doi: 10.6028/NIST.FIPS.202.
  4. R. L. Rivest, “The MD5 Message-Digest Algorithm,” 1992. [Online]. Available: https://www.rfc-editor.org/rfc/rfc1321
  5. R. H. Brown, M. L. Good, and A. Prabhakar, “Federal Information Processing Standards Publication: secure hash standard,” 1993.
  6. X. Wang, D. Feng, X. Lai, and H. Yu, “Collisions for hash functions MD4, MD5, HAVAL-128 and RIPEMD,” Cryptology ePrint Archive, Report 2004/199, 2004.
  7. M. Stevens, E. Bursztein, P. Karpman, A. Albertini, and Y. Markov, “The first collision for full SHA-1,” in Advances in Cryptology - CRYPTO 2017, Springer, 2017, pp. 570–596.
  8. J. Kelsey and B. Schneier, “Second preimages on n-bit hash functions for much less than 2^n work,” in Advances in Cryptology - EUROCRYPT 2005, Springer, 2005, pp. 474–490.
  9. G. Bertoni, J. Daemen, M. Peeters, and G. Van Assche, “Sponge functions,” in ECRYPT Hash Workshop, 2007.
  10. J.-P. Aumasson, S. Neves, Z. Wilcox-O’Hearn, and C. Winnerlein, “BLAKE2: simpler, smaller, fast as MD5,” in Applied Cryptography and Network Security (ACNS 2013), Springer, 2013, pp. 119–135.
  11. “BLAKE3 one function, fast everywhere.” [Online]. Available: https://blake3.io
  12. M. Alawida, J. Sen Teh, D. P. Oyinloye, M. Ahmad, and R. S. Alkhawaldeh, “A new hash function based on chaotic maps and deterministic finite state automata,” IEEE Access, vol. 8, pp. 176774–176788, 2020.
  13. S. K. Nanda, S. Mohanty, and P. K. Pattnaik, “An optimized 128-bit cellular automata-based hash function for authentication,” International Journal of Electrical and Computer Engineering, vol. 13, no. 2, pp. 1858–1866, 2023.
  14. S.-T. Wu and J.-R. Chang, “Secure one-way hash function using cellular automata for IoT,” Sustainability, vol. 15, no. 4, 2023.
  15. A. Akhavan, A. Samsudin, and A. Akhshani, “A novel parallel hash function based on 3D chaotic map,” EURASIP J. Adv. Signal Process., vol. 2013, 2013.
  16. Y. Li, X. Li, and X. Liu, “Chaotic complex hashing: a simple chaotic keyed hash function based on complex quadratic map,” Chaos Solitons Fractals, vol. 173, 2023.
  17. J. Tang, Z. Zhang, and T. Huang, “Hyperchaotic hashing: a chaotic hash function based on 2D linear cross-coupled map with parallel feedback structure,” Sci. Rep., vol. 15, 2025.
  18. G. Salloom and L. Hassnawi, “A Novel Hash Function Based on a Chaotic Substitution Box,” Engineering, Technology and Applied Science Research, vol. 15, no. 5, pp. 27382–27386, Oct. 2025, doi: 10.48084/etasr.12601.
  19. M. Alawida, J. Sen Teh, W. H. Alshoura, M. Ahmad, and R. S. Alkhawaldeh, “A novel hash function based on a chaotic sponge and DNA sequence,” IEEE Access, vol. 9, pp. 158995–159013, 2021.
  20. Y. Ma, S. Hassan, and F. Tahir, “Enhanced image hash using cellular automata with sponge construction and elliptic curve cryptography,” Sci. Rep., vol. 15, 2025.
  21. M. Holzer and M. Kutrib, “Reversible Nondeterministic Finite Automata,” in Reversible Computation, I. Phillips and H. Rahaman, Eds., Cham: Springer International Publishing, 2017, pp. 35–51.
  22. L. Kocarev and Z. Tasev, “Public-key encryption based on Chebyshev maps,” in Proceedings of the IEEE International Symposium on Circuits and Systems (ISCAS), 2003, pp. 28–31.
  23. P. Bergamo, P. D’Arco, A. De Santis, and L. Kocarev, “Security of public-key cryptosystems based on Chebyshev polynomials,” IEEE Transactions on Circuits and Systems I, vol. 52, no. 7, pp. 1382–1393, 2005.
  24. D. F. Ayoub, A. H. Elghandour, and S. Hashima, “A novel chaos-based generating function of the Chebyshev polynomials and its applications in image encryption,” Journal of Information Security and Applications, vol. 62, 2021.
  25. P. A. Jyotirmie, T. Surendra, A. C. Sekhar, and S. U. Devi, “Application of Mealy Machine and Recurrence Relations in Cryptography,” vol. 4, no. 5, pp. 246–250, 2013.
  26. G. H. Mealy, “A Method for Synthesizing Sequential Circuits,” 1955. doi: 10.1002/j.1538-7305.1955.tb03788.x.
  27. G. H. Mealy, “A method for synthesizing sequential circuits,” Bell System Technical Journal, vol. 34, no. 5, pp. 1045–1079, 1955.
  28. G. Bertoni, J. Daemen, M. Peeters, and G. Van Assche, “On the Indifferentiability of the Sponge Construction.” [Online]. Available: http://sponge.noekeon.org/
  29. A. Rukhin, J. Soto, and J. Nechvatal, “A statistical test suite for random and pseudorandom number generators for cryptographic applications,” 2010. https://nvlpubs.nist.gov/nistpubs/Legacy/SP/nistspecialpublication800-22r1a.pdf
  30. P. Rogaway and T. Shrimpton, “Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance.” [Online]. Available: www.cs.ucdavis.edu/~rogawaywww.ece.ucdavis.edu/~teshrim