TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Open Access ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

A novel fuzzy graph based cryptographic framework for secure communication in computer and electronic systems using discrete mathematical structures

* , , , , , , ,

* Corresponding author · click or hover a name for details

pp. 3543–3552Vol. 29Issue 9-BSeptember 2026DOI: 10.47974/JDMSC-2782 Crossmark XML
Received:
01 Oct 2025
Published Online:
30 Sep 2026
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2782
Pages:
3543–3552

Abstract

This paper presents the Fuzzy Graph–Based Cryptographic Framework (FGCF), which couples continuous-valued membership functions from fuzzy graph theory with a discrete finite-field encryption core to yield a key generation engine whose entropy significantly exceeds that of binary-graph precursors. A fuzzy graph G̃ = (V, E, μ, ρ) is parameterized with Gaussian vertex memberships μ(v) ∈ [0,1] and edge memberships ρ(e) ≤ min(μ(u), μ(v)); its chromatic number, structural entropy, and fuzzy connectivity are jointly hashed into a 384-bit master key. Block encryption proceeds through modular multiplication over a prime field Zp, augmented by a depth-first search permutation layer that exploits the graph’s traversal ordering for diffusion. Testing on 10,000 randomized plaintext samples gives a Shannon entropy of 7.9999 bits/byte, an avalanche effect of 50.6±0.3%, a maximum differential probability of 2–6.2 and a key space of 2384. Throughput reaches 131 Mbps for 256-bit blocks on standard hardware and 47 Mbps on ARM Cortex-A72 at |V| = 8, confirming IoT viability.

Keywords

Subject Classifications

05C7294A60

References

[1] D. J. Bernstein and T. Lange, “Post-quantum cryptography,” Nature, vol. 549, pp. 188–194 (Sep. 2017).

[2] L. A. Zadeh, “Fuzzy sets,” Inf. Control, vol. 8, no. 3, pp. 338–353 (1965).

[3] A. Rosenfeld, “Fuzzy graphs,” in Fuzzy Sets and Their Applications, L. A. Zadeh, K. S. Fu, K. Tanaka, and M. Shimura, Eds. New York, USA: Academic Press, pp. 77–95 (1975).

[4] J. N. Mordeson and P. S. Nair, Fuzzy Graphs and Fuzzy Hypergraphs. Heidelberg, Germany: Physica-Verlag (2000).

[5] P. Bhattacharya and S. Jain, “Graph coloring-based symmetric key generation,” Int. J. Netw. Security, vol. 19, no. 4, pp. 556–564 (Jul. 2017).

[6] C. E. Shannon, “Communication theory of secrecy systems,” Bell Syst. Tech. J., vol. 28, no. 4, pp. 656–715 (Oct. 1949).

[7] E. Biham and A. Shamir, “Differential cryptanalysis of DES-like cryptosystems,” J. Cryptol., vol. 4, no. 1, pp. 3–72 (Jan. 1991).

[8] M. Matsui, “Linear cryptanalysis method for DES cipher,” in Proc. EUROCRYPT, Lofthus, Norway, pp. 386–397 (1993).

[9] C. Paar and J. Pelzl, Understanding Cryptography: A Textbook for Students and Practitioners. Berlin, Germany: Springer (2010).

[10] M. Akram and W. A. Dudek, “Interval-valued fuzzy graphs,” Comput. Math. Appl., vol. 61, no. 2, pp. 289–299 (Jan. 2011).

[11] S. Salunkhe, A. O. Mulani, D. Shahane, M. Rana, S. M. Shukla, and M. M. Jadhav, “Secure image transmission using chaotic encryption and DWT watermarking on reconfigurable platform,” J. Discrete Math. Sci. Cryptogr., vol. 29, no. 1, pp. 349–361 (2026).

[12] K. R. Chaudhari, A. O. Mulani, M. P. Gajare, V. Jadhav, P. Yawle, and A. V. Bang, “Bit error rate analysis of various error correction codes with concatenated RS-convolutional codes,” J. Discrete Math. Sci. Cryptogr., vol. 29, no. 1, pp. 199–214 (2026).

Views: 75Downloads: 46Citations: 0