Related papers: On Another Two Cryptographic Identities In Univers…

In this paper, we introduce a new class of rings calling them {\it 2-UNJ rings}, which generalize the well-known 2-UJ, 2-UU and UNJ rings. Specifically, a ring $R$ is called 2-UNJ if, for every unit $u$ of $R$, the inclusion $u^2 \in 1 +…

The family of cycle completable graphs has several cryptomorphic descriptions, the equivalence of which has heretofore been proven by a laborious implication-cycle that detours through a motivating matrix completion problem. We give a…

We investigate group-theoretic "signatures" of odd cycles of a graph, and their connections to topological obstructions to 3-colourability. In the case of signatures derived from free groups, we prove that the existence of an odd cycle with…

Suppose that Alice and Bob define their coordinate axes differently, and the change of reference frame between them is given by a probability distribution mu over SO(3). We show that this uncertainty of reference frame is of no use for bit…

We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property. This algorithm leads to linear-time isomorphism algorithms for related graph classes, including Helly circular-arc…

We consider one of the quantum key distribution protocols recently introduced in Ref. [Pirandola et al., Nature Physics 4, 726 (2008)]. This protocol consists in a two-way quantum communication between Alice and Bob, where Alice encodes…

BIOMETRICS are an important and widely used class of methods for identity verification and access control. Biometrics are attractive because they are inherent properties of an individual. They need not be remembered like passwords, and are…

An identity that is reminiscent of the Littlewood identity plays a fundamental role in recent proofs of the facts that alternating sign triangles are equinumerous with totally symmetric self-complementary plane partitions and that…

Recently, major progress has been made towards the realisation of quantum internet to enable a broad range of classically intractable applications. These applications such as delegated quantum computation require running a secure…

Oblivious transfer is a fundamental cryptographic primitive which is useful for secure multiparty computation. There are several variants of oblivious transfer. We consider 1 out of 2 oblivious transfer, where a sender sends two bits of…

In the paper we provide some polynomial identities for finite-dimensional algebras. A list of well known single polynomial identities is exposed and the classification of all $2$-dimensional algebras with respect to these identities is…

The compatibility of the semiclassical quantization of area-preserving maps with some exact identities which follow from the unitarity of the quantum evolution operator is discussed. The quantum identities involve relations between traces…

Let L be a restricted Lie superalgebra with its restricted enveloping algebra u(L) over a field F of characteristic p>2. A polynomial identity is called non-matrix if it is not satisfied by the algebra of 2\times 2 matrices over F. We…

In password-based authentication systems, the username fields are essentially unprotected, while the password fields are susceptible to attacks. In this article, we shift our research focus from traditional authentication paradigm to the…

Let $A$ be a ring with identity, $\sigma$ a ring endomorphism of $A$ that maps the identity to itself, $\delta$ a $\sigma$-derivation of $A$, and consider the skew-polynomial ring $A[X;\sigma,\delta]$. When $A$ is a finite field, a Galois…

We derive an exact algebraic identity between the two-loop four-point amplitude in ABJM theory and the corresponding one-loop amplitude in N=4 SYM theory. This identity generalizes previous partial results to an exact relation valid at all…

In graph property testing the task is to distinguish whether a graph satisfies a given property or is "far" from having that property, preferably with a sublinear query and time complexity. In this work we initiate the study of property…

We study the two dual quantum information effects to manipulate the amount of information in quantum computation: hiding and allocation. The resulting type-and-effect system is fully expressive for irreversible quantum computing, including…

We study the generalized graph splines introduced by Gilbert, Tymoczko, and Viel and focus on an attribute known as the Universal Difference Property (UDP). We prove that paths, trees, and cycles satisfy UDP. We explore UDP on graphs pasted…

In [1], finite associative rings wih identity and such that the set of all zero-divisors form and ideal M, called the Jacobson Radical, of cube zero and square non-zero, were constructed for all the characteristics. These rings are…