Related papers: On Another Two Cryptographic Identities In Univers…
This study digs out some new algebraic properties of an Osborn loop that will help in the future to unveil the mystery behind the middle inner mappings $T_{(x)}$ of an Osborn loop. These new algebraic properties, will open our eyes more to…
A question associated with the 2005 open problem of Michael Kinyon (Is every Osborn loop universal?), is answered. Two nice identities that characterize universal (left and right universal) Osborn loops are established. Numerous new…
The present study further strenghtens the use of the Keedwell CIPQ against attack on a system. This is done as follows. The holomorphic structure of AIPQs(AIPLs) and CIPQs(CIPLs) are investigated. Necessary and sufficient conditions for the…
Isotopes of C-loops with unique non-identity squares are shown to be both C-loops and A-loops. The relationship between C-loops and Steiner loops is further studied. Central loops with the weak and cross inverse properties are also…
A loop is shown to be a universal Osborn loop if and only if it has a particular simplicial complex. A loop is shown to be a universal Osborn loop and obeys two new identities if and only if it has another particular simplicial complex. A…
The present study further strengthens the use of the Keedwell CIPQ against attack on a system by the use of the Smarandache Keedwell CIPQ for cryptography in a similar spirit in which the cross inverse property has been used by Keedwell.…
Universal Circuits (UCs) offer a promising approach to hardware Intellectual Property (IP) obfuscation, leveraging cryptographic principles to hide both structure and function in a programmable logic fabric. Their adaptability makes them…
We study non-associative twisted group algebras over $(\Z_2)^n$ with cubic twisting functions. We construct a series of algebras that extend the classical algebra of octonions in the same way as the Clifford algebras extend the algebra of…
We prove a recursive identity involving formal iterated logarithms and formal iterated exponentials. These iterated logarithms and exponentials appear in a natural extension of the logarithmic formal calculus used in the study of…
In the process of studying a conjecture of Holly M. Green and Martin W. Liebeck, we obtain two interesting identities by elementary methods, one is a combinatorial identity, and the other is a number theoretic identity.
Verifiable credentials are a digital analogue of physical credentials. Their authenticity and integrity are protected by means of cryptographic techniques, and they can be presented to verifiers to reveal attributes or even predicates about…
We give new combinatorial constructions for codes providing authentication and secrecy for equiprobable source probability distributions. In particular, we construct an infinite class of optimal authentication codes which are multiple-fold…
We derive an identity connecting any two second-order linear recurrence sequences having the same recurrence relation but whose initial terms may be different. Binomial and ordinary summation identities arising from the identity are…
Cryptographic systems are derived using units in group rings. Combinations of types of units in group rings give units not of any particular type. This includes cases of taking powers of units and products of such powers and adds the…
Recently N.Jing discovered a certain combinatorial identity from validity of the Serre relations in some vertex representations of quantum Kac-Moody algebras. We generalize this identity, in particular, extending it from polynomials to…
Let $A$ and $B$ be finite-dimensional simple algebras with arbitrary signature over an algebraically closed field. Suppose $A$ and $B$ are graded by a semigroup $S$ so that the graded identitical relations of $A$ are the same as those of…
The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between…
The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…
We develop a generalized framework for invariant-based cryptography by extending the use of structural identities as core cryptographic mechanisms. Starting from a previously introduced scheme where a secret is encoded via a four-point…
We extend the notion of $y$-variables (coefficients) in cluster algebras to cluster scattering diagrams. Accordingly, we extend the dilogarithm identity associated with a period in a cluster pattern to the one associated with a loop in a…