Related papers: A simple generalization of El-Gamal cryptosystem t…
When we consider a finite abelian group acting linearly on a polynomial ring, we can find monomial generators for the subring of invariants. By Noether's degree bound and Hilbert's finiteness theorem, we know that there are finitely many…
In the last decade, a number of public key cryptosystems based on com- binatorial group theoretic problems in braid groups have been proposed. We survey these cryptosystems and some known attacks on them. This survey includes: Basic facts…
In this paper we highlight a few open problems concerning maximal sum-free sets in abelian groups. In addition, for most even order abelian groups $G$ we asymptotically determine the number of maximal distinct sum-free subsets in $G$. Our…
There are few known computable examples of non-abelian surface holonomy. In this paper, we give several examples whose structure 2-groups are covering 2-groups and show that the surface holonomies can be computed via a simple formula in…
We construct an uncountable family of groups of type $FP$. In contrast to every previous construction of non-finitely presented groups of type $FP$ we do not use Morse theory on cubical complexes; instead we use Gromov's graphical small…
We obtain explicit formulas for the number of non-isomorphic elliptic curves with a given group structure (considered as an abstract abelian group). Moreover, we give explicit formulas for the number of distinct group structures of all…
In this paper we propose cryptosystems based on subgroup distortion in hyperbolic groups. We also include concrete examples of hyperbolic groups as possible platforms.
We suggest the usage of algebraic subsets instead of subgroups in public-key cryptography. In particular, we present the subset version of two protocols introduced by Shpilrain and Ushakov with some examples in ascending HNN-extensions of…
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of…
Blockchain brings various advantages to online transactions. However, the total transparency of these transactions may leakage users' sensitive information. Requirements on both cooperation and anonymity for companies/organizations become…
In this paper, we initiate the study of nondiagonal finite quasi-quantum groups over finite abelian groups. We mainly study the Nichols algebras in the twisted Yetter-Drinfeld module category $_{\k G}^{\k G}\mathcal{YD}^\Phi$ with $\Phi$ a…
The square root modulo problem is a known primitive in designing an asymmetric cryptosystem. It was first attempted by Rabin. Decryption failure of the Rabin cryptosystem caused by the 4-to-1 decryption output is overcome efficiently in…
In recent years, attempts to generalize lattice gauge theories to model topological order have been carried out through the so called $2$-gauge theories. These have opened the door to interesting new models and new topological phases which…
A set of quasi-uniform random variables $X_1,...,X_n$ may be generated from a finite group $G$ and $n$ of its subgroups, with the corresponding entropic vector depending on the subgroup structure of $G$. It is known that the set of entropic…
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case of two-party protocols with security against malicious…
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…
Although recent advances of blockchain systems, notably in the form of cryptocurrency, have drawn tremendous interests from both researchers and practitioners, limited studies existed toward the theoretical foundation of blockchains. This…
We propose an alternative approach for the construction of the unitary matrix which performs generalized unitary rotations of the system consisting of independent identical subsystems (for example spin system). This matrix, when applied to…
In this paper, we classify the possible group structures on the set of $R$-valued points of an abelian variety, where $R$ is any real closed field. We make use of a family of abelian varieties that, in effect, allows one to quantify over…
We introduce a natural generalization of the golden cryptography, which uses general unimodular matrices in place of the traditional Q-matrices, and prove that it preserves the original error correction properties of the encryption.…