EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Chromatic Polynomials and Cryptographic Hashing on WIP‐Quasigroup Structures

Mohammad Mazyad Hazzazi, Muhammad Nadeem, Muhammad Kamran, Komiljon Mustafoyev, Samuel Asefa Fufa

Journal of Mathematics · 2026-01 · 2026 (1)

DOI: 10.1155/jom/1583906 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Mathematics, online erschienen am 24.06.2026. Verfasst von Mohammad Mazyad Hazzazi und 4 weiteren Autor:innen. Die Arbeit nennt 46 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: King Khalid University.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Cryptographic hash functions are indispensable for today’s information security because they secure data integrity, authentication and encrypted storage. Recently, graph‐theoretic constructions have acquired interest in the design of hash functions because of their noteworthy sensitivity to structural alterations and rich combinatorial structure. Chromatic polynomials of graphs, in particular, are intriguing possibilities for cryptographic hashing processes because they exhibit strong combinatorial invariants whose values alter substantially under minor changes to the underlying graph. In this paper, we give a hashing framework based on chromatic polynomials generated by graphs related to weak inverse property quasigroups. Graph models can be utilized naturally represent the algebraic subloops of weak inverse property quasigroups, an important type of nonassociative algebraic structures. The chromatic polynomials , and have been calculated and investigated along with the polynomial of the complete bipartite graph K 3 n ,3 n . These polynomials are the fundamental components of the recommended hashing algorithm and encompass significant combinatorial characteristics found in the underlying algebraic structures.

Förderung

  • King Khalid University

Zitieren

APA

Hazzazi, M. M., Nadeem, M., Kamran, M., Mustafoyev, K., & Fufa, S. A. (2026). Chromatic Polynomials and Cryptographic Hashing on WIP‐Quasigroup Structures. Journal of Mathematics, 2026(1). https://doi.org/10.1155/jom/1583906

Vancouver

Hazzazi MM, Nadeem M, Kamran M, Mustafoyev K, Fufa SA. Chromatic Polynomials and Cryptographic Hashing on WIP‐Quasigroup Structures. Journal of Mathematics. 2026;2026(1). doi:10.1155/jom/1583906

BibTeX
@article{Hazzazi2026,
  author = {Hazzazi, Mohammad Mazyad and Nadeem, Muhammad and Kamran, Muhammad and Mustafoyev, Komiljon and Fufa, Samuel Asefa},
  title = {Chromatic Polynomials and Cryptographic Hashing on WIP‐Quasigroup Structures},
  journal = {Journal of Mathematics},
  year = {2026},
  volume = {2026},
  number = {1},
  doi = {10.1155/jom/1583906}
}
Kostenlos starten →