Related papers: On Another Two Cryptographic Identities In Univers…

The main purpose of this paper is to give an overview over the theory of abelian varieties, with main focus on Jacobian varieties of curves reaching from well-known results till to latest developments and their usage in cryptography. In the…

We prove quantum dilogarithm identities for $n$-cycle quivers. By the combinatorial approach of Keller, each side of our identity determines a maximal green sequence of quiver mutations. Thus we interpret our identities as factorizations of…

We introduce I/O-optimal certifying algorithms for bipartite graphs, as well as for the classes of split, threshold, bipartite chain, and trivially perfect graphs. When the input graph is a class member, the certifying algorithm returns a…

Using the quantum cluster algebra formalism of Fock and Goncharov, we present several forms of quantum dilogarithm identities associated with periodicities in quantum cluster algebras, namely, the tropical, universal, and local forms. We…

Corresponding to a certain Wronskian identity, we present two types of new Casoratian identities. We apply these identities to the Darboux transformations of quantum mechanical systems. The Wronskian identity is applied to the ordinary…

When elementary quantum systems, such as polarized photons, are used to transmit digital information, the uncertainty principle gives rise to novel cryptographic phenomena unachievable with traditional transmission media, e.g. a…

A strong converse bound for the classical identification capacity of a quantum channel is an upper bound on the asymptotic identification rate of classical messages sent through the channel, such that, above this rate, the probability of an…

We provide geometric methods and algorithms to verify, construct and enumerate pairs of words (of specified length over a fixed $m$-letter alphabet) that form identities in the semigroup $\ut{n}$ of $n\times n$ upper triangular tropical…

We give a variation of McShane's identity, which describes the cusp shape of a hyperbolic 2-bridge link in terms of the complex translation lengths of simple loops on the bridge sphere. We also explicitly determine the set of end invariants…

In this paper we proposed two identification schemes based on the root problem. The proposed schemes are secure against passive attacks assuming that the root problem (RP) is hard in braid groups.

Given word on $n$ letters, we study groups which satisfiy "iterated identity" $w$, meaning that for all $x_1, \dots, x_n$ there exists $m$ such that $m$-the iteration of $w$ of Engel type, applied to $x_1, \dots, x_n$, is equal to the…

Using Lipman's results on resolution of two-dimensional singularities, we provide a form of resolution of singularities in codimension two for reduced quasi-excellent schemes. We deduce that operations of degree less than two on algebraic…

Quasi-identifier-based deidentification techniques (QI-deidentification) are widely used in practice, including $k$-anonymity, $\ell$-diversity, and $t$-closeness. We present three new attacks on QI-deidentification: two theoretical attacks…

We consider two basic algorithmic problems concerning tuples of (skew-)symmetric matrices. The first problem asks to decide, given two tuples of (skew-)symmetric matrices $(B_1, \dots, B_m)$ and $(C_1, \dots, C_m)$, whether there exists an…

In this paper, the results of part I regarding a special case of Feynman identity are extended. The sign rule for a path in terms of data encoded by its word and formulas for the numbers of distinct equivalence classes of nonperiodic paths…

Starting from basic identities of the group E8, we perform progressive reductions, namely decompositions with respect to the maximal and symmetric embeddings of E7xSU(2) and then of E6xU(1). This procedure provides a systematic approach to…

Answering an open question from 2007, we construct infinite $k$-crossing-critical families of graphs that contain vertices of any prescribed odd degree, for any sufficiently large~$k$. To answer this question, we introduce several…

We consider the problem of information-theoretic secrecy in identification schemes rather than transmission schemes. In identification, large identities are encoded into small challenges sent with the sole goal of allowing at the receiver…

We revisit the complexity of verifying basic identities, such as associativity and distributivity, on a given finite algebraic structure. In particular, while Rajagopalan and Schulman (FOCS'96, SICOMP'00) gave a surprising randomized…

Quantum cryptography uses techniques and ideas from physics and computer science. The combination of these ideas makes the security proofs of quantum cryptography a complicated task. To prove that a quantum-cryptography protocol is secure,…