Related papers: Cryptosystems Using Automorphisms of Finitely Gene…
We study the action of the group Aut(F_n) of automorphisms of a finitely generated free group on the degree 2 subcomplex of the spine of Auter space. Hatcher and Vogtmann showed that this subcomplex is simply connected, and we use the…
We propose a Fourier domain asymmetric cryptosystem for multimodal biometric security. One modality of biometrics (such as face) is used as the plaintext, which is encrypted by another modality of biometrics (such as fingerprint). A private…
We describe the automorphism group of the endomorphism semigroup $\End(K[x_1,...,x_n])$ of ring $K[x_1,...,x_n]$ of polynomials over an {\it arbitrary} field $K$. A similar result is obtained for automorphism group of the category of…
Fully homomorphic encryption is an encryption method with the property that any computation on the plaintext can be performed by a party having access to the ciphertext only. Here, we formally define and give schemes for quantum homomorphic…
A main result is that, roughly, a dense set of the infinitesimal trace-preserving deformations of a semicircular system $s_1,..., s_n$ arise from one-parameter groups of automorphisms of the free-group factor $L(F(n))$ generated by…
The present work investigates a type of morphisms between encryption schemes, called bridges. By associating an encryption scheme to every such bridge, we define and examine their security. Inspired by the bootstrapping procedure used by…
Modern cryptography, such as Rivest Shamir Adleman (RSA) and Secure Hash Algorithm (SHA), has been designed by humans based on our understanding of cryptographic methods. Neural Network (NN) based cryptography is being investigated due to…
The braid group is an important non commutative group, at the same time, it is an important tool in quantum field theory with better topological structure, and often used as a research carrier for anti-quantum cryptographic algorithms. This…
Let $F(x, y)$ be a binary form of degree at least three and non-zero discriminant. In this article we compute the automorphism group $\operatorname{Aut} F$ for four families of binary forms. The first two families that we are interested in…
We show that the following problems are decidable in a rank 2 free group F_2: does a given finitely generated subgroup H contain primitive elements? and does H meet the orbit of a given word u under the action of G, the group of…
Let G be a free group in a variety of groups, but G is not absolutely free. We prove that the group of automorphisms Aut(G) is linear iff G is a virtually nilpotent group.
We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one…
For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…
We study the automorphism groups of free-by-cyclic groups and show these are finitely generated in the following cases: (i) when defining automorphism has linear growth and (ii) when the rank of the underlying free group has rank at most 3.…
This paper uses the methods from arXiv:0804.1396 to give 'short' presentations for Aut$^+(F_n)$, the special automorphism group of the free group of rank $n$, and Out $^+(F_n)$ the special outer automorphism group of the free group of rank…
In this article, we study the outer automorphism group of a group G decomposed as a finite graph of group with finite edge groups and finitely generated vertex groups with at most one end. We show that Out(G) is essentially obtained by…
We briefly explain how to implement the morphisms in our paper ``Natural representations of black box groups encrypting $SL_2(\mathbb{F})$" and provide some examples.
In this paper, we extend the ElGamal cryptosystem to the third group of units of the ring $\Z_{n}$, which we prove to be more secure than the previous extensions. We describe the arithmetic needed in the new setting. We also provide some…
Let F_n be the free group of rank n and let Aut^+(F_n) be its special automorphism group. For an epimorphism pi : F_n -> G of the free group F_n onto a finite group G we call Gamma^+(G,pi) = {f in Aut^+(F_n) | pi*f = pi} the standard…
If $G$ is a finite group and $k =q>2$ or $k=q+1$ for a prime power $q$ then, for infinitely many integers $v$, there is a $2$-$(v,k,1)$-design ${\bf D}$ for which ${\rm Aut} {\bf D}\cong G$.