Investigation of expander graph families for designing highperformance cryptographic hash functions
Suraj Bhansuraj.bhan@niu.edu.inSchool of Engineering & TechnologyNoida International UniversityGreater Noida, Uttar Pradesh, 203201, IndiaView full profile → , *M. Janaki Rama RaoCorresponding authorjanakiram.aditya@gmail.comDepartment of Computer ScienceAditya Degree & PG College (Autonomous)Kakinada, Andhra Pradesh, 533003, IndiaView full profile → , Frederick Sidney Correafrederick.correa.orp@chitkara.edu.inCentre for Research Impact & OutcomeChitkara University Institute of Engineering and TechnologyChitkara UniversityRajpura, Punjab, 140401, India0009-0003-1964-3815View full profile → , Shobhit Goyalshobhit.goyal@quantumeducation.inQuantum University Research CenterQuantum UniversityRoorkee, Uttarakhand, 247667, India0009-0009-2291-7614View full profile → , Kamineni Sairamkaminenisairam@yahoo.comCentre for Multidisciplinary ResearchAnurag UniversityHyderabad, Telangana, 500088, India0009-0005-6289-987XView full profile → , Vikram V. Patelvikrampatel@gokuluniversity.ac.inFaculty of EngineeringGokul Global UniversitySidhpur, Gujarat, 384151, India0009-0006-4834-6766View 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-3085
- Pages:
- 4705–4718
Abstract
In current digital systems, such as blockchain, secure communications, and distributed computing environments, cryptographic hash functions are basic primitives to guarantee data integrity, authentication and security. The current design of hash functions (SHA-2 and SHA-3) are however limited in their ability to trade off computational efficiency and good theoretical diffusion and security guarantees, especially with new high-performance and post-quantum demands. This gap is filled in this paper by exploring expander graph families as a mathematical basis to designing high-performance cryptographic hash functions. The main aim of the research is to create a new expander-based hash-function framework exploiting the expansion strength and speed of mixing to achieve a higher level of security as well as efficiency. The suggested methodology combines the message-dependent random walks on d-regular expander graphs, and non-linear compression functions to build the hash output. Spectral properties and expansion measures are also used to achieve good diffusion and anti-cryptographic attacks resistance. Experimental analysis and comparison prove that the proposed model has better performance with a lower execution time (10.3 ms), higher throughput (92 MB/s), and a more prominent avalanche effect (50.6%) compared to the use of SHA-256, SHA-3 and ZemorTillich hash functions.
Keywords
Subject Classifications
References
[1] Y. Aikawa, H. Jo, and S. Satake, “Left-right Cayley hashing: A new framework for provably secure hash functions,” Math. Cryptol., vol. 3, no. 2, pp. 53–65 (2023).
[2] W. Castryck, T. Decru, and B. Smith, “Hash functions from superspecial genus-2 curves using Richelot isogenies,” J. Math. Cryptol., vol. 14, no. 1, pp. 268–292 (2020), doi: 10.1515/jmc-2019-0021.
[3] C. Costello and B. Smith, “The supersingular isogeny problem in genus 2 and beyond,” in Post-Quantum Cryptography (PQCrypto 2020), Lecture Notes in Computer Science, vol. 12100. Cham, Switzerland: Springer (2020), doi: 10.1007/978-3-030-44223-1_9.
[4] I. Dinur, S. Evra, R. Livne, A. Lubotzky, and S. Mozes, “Locally testable codes with constant rate, distance, and locality,” in Proc. 54th Annu. ACM SIGACT Symp. Theory Comput. (STOC), pp. 357–374 (2022), doi: 10.1145/3519935.3520024.
[5] L. De Feo, D. Kohel, and B. Smith, “Towards practical isogeny-based cryptography,” Commun. ACM, vol. 67, no. 2, pp. 84–93 (2024).
[6] E. Florit and B. Smith, “Automorphisms and isogeny graphs of abelian varieties, with applications to the superspecial Richelot isogeny graph,” in Arithmetic Geometry, Cryptography, and Coding Theory, vol. 779. Providence, RI, USA: American Mathematical Society, pp. 103–132 (2021).
[7] K. Roy and S. Mazumder, “Encryption scheme of modified Caesar cipher using bipartite graph,” J. Inf. Optim. Sci., vol. 46, no. 5, pp. 1645–1658 (2025), doi: 10.47974/JIOS-1880.
[8] R. C. Poonia, T. Singh, C. K. Rajashri, D. Mondal, and S. M. Patil, “Optimizing communication system security through comprehensive testing and intelligent network configurations,” J. Inf. Optim. Sci., vol. 47, no. 5-A, pp. 1709–1717 (2026), doi: 10.47974/JIOS-2261.
[9] P. C. Golar, P. D. Shobhane, S. I. Baltabaevich, P. Karemore, S. Kedar, and P. Dubey, “Designing AI-driven information security protocols using discrete mathematical models,” J. Discrete Math. Sci. Cryptogr., vol. 29, no. 2-B, pp. 789–796 (2026), doi: 10.47974/JDMSC-2525.
[10] A. Mittelbach and M. Fischlin, The Theory of Hash Functions and Random Oracles: An Approach to Modern Cryptography. Cham, Switzerland: Springer (2021).
[11] T. Moriya, K. Onuki, and Y. Takashima, “Recent advances in isogeny-based cryptography and applications,” IEEE Access, vol. 12, pp. 45123–45145 (2024).
[12] M. C.-R. Santos, C. Costello, and S. Frengley, “An algorithm for efficient detection of splittings and its application to the isogeny problem in dimension 2,” IACR Cryptol. ePrint Arch., Rep. 2022/1736 (2022).
[13] H. Tomkins, M. Nevins, and H. Salmasian, “New Zémor–Tillich type hash functions,” J. Math. Cryptol., vol. 14, no. 1, pp. 236–253 (2020), doi: 10.1515/jmc-2019-0033.
[14] Y. Zaytman, “Proving connectedness of isogeny graphs with strong approximation,” RIMS Kôkyûroku Bessatsu, vol. B90, pp. 145–151 (2022).
