Related papers: On Another Two Cryptographic Identities In Univers…
We present several generalizations of results for splitting authentication codes by studying the aspect of multi-fold security. As the two primary results, we prove a combinatorial lower bound on the number of encoding rules and a…
Some applications of a result, which is proved recently, is considered. We first prove three determinantal identities concerning the binomial coefficient and Stirling numbers of the first and the second kind. We also easily obtain the…
It is proved that the five well-known identities universally satisfied by commutators in a group generate all universal commutator identities for commutators of weight 4.
This work derives an application from the identities of arXiv:hep-th/0602028 in order to invert four point functions in defect conformal field theories. For this, a recursion relation is established and the O(N) model with a line defect is…
We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…
It had been widely claimed that quantum mechanics can protect private information during public decision in for example the so-called two-party secure computation. If this were the case, quantum smart-cards could prevent fake teller…
We derive some Fibonacci and Lucas identities which contain inverse binomial coefficients. Extension of the results to the general Horadam sequence is possible, in some cases.
An open problem in the theory of inverse semigroups was whether the variety of such semigroups, when viewed as algebras with a binary operation and a unary operation, is 2-based, that is, has a base for its identities consisting of 2…
Dilogarithm identities for the central charges and conformal dimensions exist for at least large classes of rational conformally invariant quantum field theories in two dimensions. In many cases, proofs are not yet known but the numerical…
Powerful skew arithmetic circuits are introduced. These are skew arithmetic circuits with variables, where input gates can be labelled with powers $x^n$ for binary encoded numbers $n$. It is shown that polynomial identity testing for…
Let $\Gamma$ be a multigraph with for each vertex a cyclic order of the edges incident with it. For $n \geq 3$, let $D_{2n}$ be the dihedral group of order $2n$. Define $\mathbb{D} := \{(\begin{smallmatrix} 1 & a \\ 0 & 1 \end{smallmatrix})…
Credential brokers offer a way to separate identity from access in CI/CD systems. This paper shows how verifiable identities issued at runtime, such as those from SPIFFE, can be used with brokers to enable short-lived, policy-driven…
Isogenies, the mappings of elliptic curves, have become a useful tool in cryptology. These mathematical objects have been proposed for use in computing pairings, constructing hash functions and random number generators, and analyzing the…
We introduce a new tool for the study of isogeny-based cryptography, namely pairings which are sesquilinear (conjugate linear) with respect to the $\mathcal{O}$-module structure of an elliptic curve with CM by an imaginary quadratic order…
In this paper we prove a collection of results on the structure of permutations in the Clifford Hierarchy. First, we leverage results from the cryptography literature on affine equivalence classes of 4-bit permutations which we use to find…
We consider quantum cryptographic schemes where the carriers of information are 3-state particles. One protocol uses four mutually unbiased bases and appears to provide better security than obtainable with 2-state carriers. Another possible…
The Jordan algebra of the symmetric matrices of order two over a field $K$ has two natural gradings by $\mathbb{Z}_2$, the cyclic group of order 2. We describe the graded polynomial identities for these two gradings when the base field is…
Two cross caps in Euclidean $3$-space are said to be formally isometric if their Taylor expansions of the first fundamental forms coincide by taking a suitable local coordinate system. For a given $C^\infty$ cross cap $f$, we give a method…
The ordinary Structure Identity Principle states that any property of set-level structures (e.g., posets, groups, rings, fields) definable in Univalent Foundations is invariant under isomorphism: more specifically, identifications of…
The Hamiltonian cycle polynomial can be evaluated to count the number of Hamiltonian cycles in a graph. It can also be viewed as a list of all spanning cycles of length $n$. We adopt the latter perspective and present a pair of original…