Related papers: Aperiodic logarithmic signatures
The present paper proposes a new and systematic approach to the so-called black box group methods in computational group theory. Instead of a single black box, we consider categories of black boxes and their morphisms. This makes new…
Let $\Sigma$ be a closed surface other than the sphere, the torus, the projective plane or the Klein bottle. We construct a continuum of p.m.p. ergodic minimal profinite actions for the fundamental group of $\Sigma$, that are topologically…
In this paper we will give various examples of exponentially distorted subgroups in linear groups, including some new example of subgroups of $SL_n(\mathbb{Z}[x])$ for $n \ge 3$, and show how they can be used to construct symmetric-key…
We study actions of diagonalizable groups on toroidal schemes (i.e. logarithmically regular logarithmic schemes). In particular, we show that for so-called toroidal actions the quotient is again a toroidal scheme. Our main result constructs…
We give an algorithm for constructing the algebraic hull of a given matrix Lie algebra in characteristic zero. It is based on an algorithm for finding integral linear dependencies of the roots of a polynomial, that is probably of…
We present an entirely 2D transversal realization of phase gates at any level of the Clifford hierarchy, and beyond, using non-Abelian surface codes. Our construction encodes a logical qubit in the quantum double $D(G)$ of a non-Abelian…
In this paper, we present a new diverse class of post-quantum group-based Digital Signature Schemes (DSS). The approach is significantly different from previous examples of group-based digital signatures and adopts the framework of group…
The semidirect discrete logarithm problem (SDLP) is the following analogue of the standard discrete logarithm problem in the semidirect product semigroup $G\rtimes \mathrm{End}(G)$ for a finite semigroup $G$. Given $g\in G, \sigma\in…
We introduce a property of mutation loops, called the sign stability, with a focus on an asymptotic behavior of the iteration of the tropical $\mathcal{X}$-transformation. A sign-stable mutation loop has a numerical invariant which we call…
Arc permutations, which were originally introduced in the study of triangulations and characters, have recently been shown to have interesting combinatorial properties. The first part of this paper continues their study by providing signed…
Construct the first provably secure linear homomorphic ring signature scheme. Ring signatures allow a signer to anonymously sign a message on behalf of a user group (ring) and are widely applied in areas such as identity protection,…
In this paper, we give a criterion for the existence of logarithmic embeddings -- which was first introduced by Steenbrink -- for general normal crossing varieties. Using this criterion, we also give a new proof of the theorem of…
Let PC be the group of bijections from [0, 1[ to itself which are continuous outside a finite set. Let PC be its quotient by the subgroup of finitely supported permutations. We show that the Kapoudjian class of PC vanishes. That is, the…
A graph is probe diamond-free if its vertex set admits a partition into probes and nonprobes, where the set of nonprobes is independent, such that adding edges only between pairs of nonprobes yields a diamond-free graph. Although this class…
Integer factorization is a computational problem of fundamental importance in cybersecurity and secure communications, as its difficulty form the basis of modern public-key cryptography. While Shor's algorithm can solve this problem…
In [Huang-Raskind 2009], the authors proved that the discrete logarithm problem in a prime finite field is random polynomial time equivalent to computing the ramification signature of a real quadratic field. In this paper, we do this for a…
Let $p$ be a prime number. Let $X/E$ be a geometrically connected, smooth, quasi-projective variety over a finite extension $E/\mathbb{Q}_p$. In this paper I demonstrate the existence of isomorphs of the tempered (and hence also \'etale)…
In this paper we consider a quantum computational variant of nondeterminism based on the notion of a quantum proof, which is a quantum state that plays a role similar to a certificate in an NP-type proof. Specifically, we consider quantum…
A Ringel ladder can be formed by a self-bar-amalgamation operation on a symmetric ladder, that is, by joining the root vertices on its end-rungs. The present authors have previously derived criteria under which linear chains of copies of…
In the paper "An Abelian Loop for Non-Composites" (arXiv:110.14716), we introduced a group-like structure consisting of odd prime numbers and 1, with properties that allowed us to prove analogous results to well known theorems in Number…