Cryptographic hash functions derived from expander graphs
*Dipti Yashodhan SakhareCorresponding authordipti.sakhare@mitaoe.ac.inDepartment of Electronics & Telecommunication EngineeringMIT Academy of EngineeringAlandi, Pune, Maharashtra, 412105, IndiaView full profile → , Yogesh Shankarrao Lonkaryogesh.lonkar@vit.eduDepartment of Artificial Intelligence & Data ScienceVishwakarma Institute of TechnologyBibwewadi, Pune, Maharashtra, 411037, IndiaView full profile → , M. Raghavendraraghavendra1797@vardhaman.orgDepartment of Computer Science and EngineeringVardhaman College of EngineeringShamshabad, Hyderabad, Telangana, 501218, IndiaView full profile → , S. Rama Sreeramasree_s@adityauniversity.inDepartment of Computer Science & EngineeringAditya UniversitySurampalem, Kakinada District, Andhra Pradesh, 533437, IndiaView full profile → , S. Loganathanloganathan.avmts022@avit.ac.inDepartment of Humanities and Sciences (Mathematics Division)Aarupadai Veedu Institute of TechnologyVinayaka Mission’s Research Foundation (Deemed to be University)Paiyanoor, Chennai, Tamil Nadu, 603104, IndiaView full profile → , Preeti Pandurang Kalepreetikale2025@gmail.comDepartment of Electronics & Computer EngineeringCSMSS Chh. Shahu College of EngineeringChhatrapati Sambhajinagar, Maharashtra, 431011, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Apr 2026
- Published Online:
- 31 Oct 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-3036
- Pages:
- 4109–4119
Abstract
In modern-day digital systems, cryptographic hash functions can be highly important in providing data integrity, authentication and security. They present in this paper a new model of constructing hash functions out of expander graphs, which is well-connected and has a pseudo-random property. The suggested strategy makes use of algebraic constructions of Cayley and Ramanujan graphs to obtain better diffusion and confusion. It is suggested to generate a deterministic node labelling and state transitioning mechanism, which generates fixed length hash values of high entropy. Through experimental analysis, the collision resistance of 98.2, preimage resistance of 97.5 and reduced computational cost of 12.6 are observed to be better than the traditional hash schemes. The architecture is very scalable and not vulnerable to cryptanalytic attacks. The paper highlights the potential of the expander-based constructions to the next generation of lightweight and secure cryptographic applications.
Keywords
Subject Classifications
References
[1] A Netto Mertia and M. Sudha, “Synthesis of index difference graph structures for cryptographic implementation,” Symmetry, vol. 17, no. 9, Art. no. 1568 (2025), doi: 10.3390/sym17091568.
[2] F. Ablayev, K. Khadiev, A. Vasiliev, and M. Ziiatdinov, “Theory and applications of quantum hashing,” Quantum Reports, vol. 7, no. 2, Art. no. 24 (2025), doi: 10.3390/quantum7020024.
[3] M. Qi and D. Wang, “Secure parallel image cryptographic hash function using a novel 2D high-randomness hyperchaotic map,” Mathematics, vol. 13, no. 11, Art. no. 1890 (2025), doi: 10.3390/math13111890.
[4] K. Algazy, K. Sakan, N. Kapalova, S. Nyssanbayeva, and D. Dyusenbayev, “Differential analysis of a cryptographic hashing algorithm HBC-256,” Applied Sciences, vol. 12, no. 19, Art. no. 10173 (2022), doi: 10.3390/app121910173.
[5] M. Gladis Kurian and Y. Chen, “The untapped potential of Ascon hash functions: Benchmarking, hardware profiling, and application insights for secure IoT and blockchain systems,” Sensors, vol. 25, no. 19, Art. no. 5936 (2025), doi: 10.3390/s25195936.
[6] M. G. Dhote, B. M. Nanche, P. N. Mahalle, S. S. Ali, M. Gulhane, and V. S. Karwande, “Deep learning for optimized path planning in autonomous vehicles by integrating reinforcement learning with convolutional neural networks,” Journal of Information and Optimization Sciences, vol. 46, no. 4-B, pp. 1129–1139 (2025).
[7] R. Abraham and H. El-Chaarani, “A mathematical formulation of the valuation of Ether and Ether derivatives as a function of investor sentiment and price jumps,” Journal of Risk and Financial Management, vol. 15, no. 12, Art. no. 591 (2022), doi: 10.3390/jrfm15120591.
[8] K. Algazy, K. Sakan, S. Nyssanbayeva, and O. Lizunov, “Syrga2: Post-quantum hash-based signature scheme,” Computation, vol. 12, no. 6, Art. no. 125 (2024), doi: 10.3390/computation12060125.
[9] M. Al-Zubaidie, “Implication of lightweight and robust hash function to support key exchange in health sensor networks,” Symmetry, vol. 15, no. 1, Art. no. 152 (2023), doi: 10.3390/sym15010152.
[10] N. E. El-Meligy, T. O. Diab, A. S. Mohra, A. Y. Hassan, and W. I. El-Sobky, “A novel dynamic mathematical model applied in hash function based on DNA algorithm and chaotic maps,” Mathematics, vol. 10, no. 8, Art. no. 1333 (2022), doi: 10.3390/math10081333.
[11] S. S. Dari, D. Dhabliya, A. Dhablia, S. Dingankar, M. J. Pasha, and S. N. Ajani, “Securing micro transactions in the Internet of Things with cryptography primitives,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 27, no. 2-B, pp. 753–762 (2024).
[12] G. Muhiuddin, A. Meenakshi, J. Kacprzyk, G. Ambika, and H. Rashmamlou, “A novel approach to strengthening cryptography using RSA, efficient domination and fuzzy logic,” Axioms, vol. 14, no. 5, Art. no. 392 (2025), doi: 10.3390/axioms14050392.
[13] R. C. Poonia, R. Almakki, A. K. J. Saudagar, A. Altameem, and M. Albathan, “An optimization approach for real-time object detection in IoT devices through edge computing and deep learning,” Journal of Information and Optimization Sciences, vol. 45, no. 5, pp. 1465–1475 (2024), doi: 10.47974/JIOS-1768.
