Results 11 to 20 of about 166 (137)
A connection between cryptography and polynomial functions is extremely significant. Mathematical performance of polynomials helps to enhance the cryptographic primitives, which are trustworthy as well as straightforward representation tools, in everyday
Mohammad Mazyad Hazzazi +4 more
doaj +2 more sources
Eigenvalues of Relatively Prime Graphs Connected with Finite Quasigroups
A relatively new and rapidly expanding area of mathematics research is the study of graphs’ spectral properties. Spectral graph theory plays a very important role in understanding certifiable applications such as cryptography, combinatorial design, and ...
Muhammad Nadeem +5 more
doaj +2 more sources
An Algebraic Approach of Topological Indices Connected with Finite Quasigroups
In mathematical chemistry, the algebraic polynomial serves as essential for calculating the most accurate expressions of distance-based, degree-distance-based, and degree-based topological indices.
Muhammad Nadeem +3 more
doaj +2 more sources
Chromatic Polynomials and Cryptographic Hashing on WIP-Quasigroup Structures
Cryptographic hash functions are indispensable for today’s information security because they secure data integrity, authentication and encrypted storage.
Mohammad Mazyad Hazzazi +4 more
doaj +2 more sources
Taking into account the most recent improvements in graph theory and algebra, we can associate graphs of some mathematical structures with certifiable, widely known applications.
Mohammad Mazyad Hazzazi +4 more
doaj +2 more sources
Research on the confluence of algebra, graph theory, and machine learning has resulted in significant discoveries in mathematics, computer science, and artificial intelligence. Polynomial coefficients can be beneficial in machine learning.
Faizah D. Alanazi
doaj +2 more sources
Nonassociative algebra presents multiple options for comprehending and dealing with difficulties in graph theory, artificial intelligence, and cryptography.
Mohammad Mazyad Hazzazi +4 more
doaj +2 more sources
Paige loops, simple non-associative Moufang loops, were constructed by Paige as quotients of the set of Zorn vector-matrices of unit norm under split octonion multiplication. In this paper, we show that the same quotient set sustains two related simple quasigroup structures, in which the split octonion multiplication is replaced with multiplication ...
Smith, Jonathan D. H. +1 more
openaire +2 more sources
Cycles of quadratic Latin squares and antiperfect 1‐factorisations
Abstract A Latin square of order n $n$ is an n × n $n\times n$ matrix of n $n$ symbols, such that each symbol occurs exactly once in each row and column. For an odd prime power q $q$ let F q ${{\mathbb{F}}}_{q}$ denote the finite field of order q $q$.
Jack Allsop
wiley +1 more source

