Related papers: Cryptosystems Using Automorphisms of Finitely Gene…
A new infinite series of rational affine algebraic varieties is constructed whose automorphism group contains the automorphism group ${\rm Aut}(F_n)$ of the free group $F_n$ of rank $n$. The automorphism groups of such varieties are…
Let \phi be an endomorphism of a finitely generated free group F, and let H be a finite-index subgroup of F that is invariant under \phi. The nonzero eigenvalues of \phi are contained in the eigenvalues of \phi restricted to H.
We show that all permutations in $S_n$ can be generated by affine unicritical polynomials. We use the $\operatorname{PGL}$ group structure to compute the cycle structure of permutations with low Carlitz rank. The tree structure of the group…
We obfuscate words of a given length in a free monoid on two generators with a simple factorization algorithm (namely $SL_2(\mathbb{N})$) to create a public-key encryption scheme. We provide a reference implementation in Python and…
A cryptographic algorithm is proposed based on fully quantum mechanical keys and ciphers. Encryption and decryption are carried out via an appropriate measurement process on entangled states as governed by a quantum mechanical, asymmetrical…
We study the automorphism groups attached to a free algebra with multiple, possibly infinitely many, composition laws. As an application, we prove that the automorphism group of finitely generated vertex algebras over noetherian rings are…
Nielsen reduction is an algorithm which decomposes any automorphism of a free group into a product of elementary Nielsen transformations. While this may be applied to a mapping class of a surface $S_{g,1}$ with one boundary component, the…
We generalise the Karrass-Pietrowski-Solitar and the Nielsen realisation theorems from the setting of free groups to that of free products. As a result, we obtain a fixed point theorem for finite groups of outer automorphisms acting on the…
With the emergence of privacy leaks in federated learning, secure aggregation protocols that mainly adopt either homomorphic encryption or threshold secret sharing have been widely developed for federated learning to protect the privacy of…
The group of automorphisms of a symbolic dynamical system is countable, but often very large. For example, for a mixing subshift of finite type, the automorphism group contains isomorphic copies of the free group on two generators and the…
We study the automorphisms of binary stabilizer codes and states. We prove that they almost always form a solvable group, and thereby shed new light on the fact that there is no universal set of transversal gates. We also determine the…
The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…
For any algebraically closed field $K$ and any endomorphism $f$ of $\mathbb{P}^1(K)$ of degree at least 2, the automorphisms of $f$ are the M\"obius transformations that commute with $f$, and these form a finite subgroup of…
We prove that the automorphism group of an arbitrary non-abelian free group is complete. It generalizes the result by J.Dyer and E.Formanek (1975) stating the completeness of automorphism group of finitely generated free groups. Using the…
We calculate the homology of automorphism groups of free groups in various cases. The author would like to thank his thesis advisor Karen Vogtmann.
We study the automorphism group $\operatorname{Aut}(X)$ of a non-trivial strongly irreducible subshift $X$ on an arbitrary infinite group $G$ and generalize classical results of Ryan, Kim and Roush. We generalize Ryan's theorem by showing…
Most common public key cryptosystems and public key exchange protocols presently in use, such as the RSA algorithm, Diffie-Hellman, and elliptic curve methods are number theory based and hence depend on the structure of abelian groups. The…
In this paper we generalize the definition of a multilinear map to arbitrary groups and develop a novel idea of multilinear cryptosystem using nilpotent group identities.
Let $A=A(x_{1},...,x_{n})$ be a free associative algebra in $\mathcal{A}$ freely generated over $K$ by a set $X=\{x_{1},...,x_{n}\}$, $End A$ be the semigroup of endomorphisms of $A$, and $Aut End A$ be the group of automorphisms of the…
For a finitely generated group $G$ the Nielsen graph $N_n(G)$, $n\geq \operatorname{rank}(G)$, describes the action of the group $\operatorname{Aut}F_n$ of automorphisms of the free group $F_n$ on generating $n$-tuples of G by elementary…