Related papers: Group Signature Schemes Using Braid Groups
We solve the simultaneous conjugacy problem in Artin's braid groups and, more generally, in Garside groups, by means of a complete, effectively computable, finite invariant. This invariant generalizes the one-dimensional notion of super…
We ask if any finite type generalized braid group is a subgroup of some classical Artin braid group. We define a natural map from a given finite type generalized braid group to a classical braid group and ask if this map is an injective…
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…
We describe a constructive, cubic time solution to the conjugacy problem in Artin groups of extra-large type, which was proved solvable in those groups by Appel and Schupp. We use results from two of our previous papers that characterise…
We describe the fundamental groups of ordered and unordered k point sets in complex projective space of dimension n generating a projective subspace of dimension i. We apply these to study connectivity of more complicated configurations of…
In this paper, an algorithm is aimed to make a cryptosystem for gray level images based on voice features, secret sharing scheme and electromagnetic rotor machine. Here, Shamir secret sharing (k n) threshold scheme is used to secure a key…
We give a computational algorithm which decides if a braid is quasipositive or not. A braid is quasipositive if it's a product of conjuguates of generators. For this, we use the theory of Garside and the combinatorials properties of the…
Braid groups are an important and flexible tool used in several areas of science, such as Knot Theory (Alexander's theorem), Mathematical Physics (Yang-Baxter's equation) and Algebraic Geometry (monodromy invariants). In this note we will…
We construct an embedding of any right-angled Artin group $G(\Delta)$ defined by a graph $\Delta$ into a graph braid group. The number of strands required for the braid group is equal to the chromatic number of $\Delta$. This construction…
In this research work, security concepts are formalized in steganography, and the common paradigms based on information theory are replaced by another ones inspired from cryptography, more practicable are closer than what is usually done in…
This paper proposes a new signature scheme based on two hard problems : the cube root extraction modulo a composite moduli (which is equivalent to the factorisation of the moduli, IFP) and the discrete logarithm problem(DLP). By combining…
This article is a short introduction to the theory of the groups of points of elliptic curves over finite fields. It is concerned with the elementary theory and practice of elliptic curves cryptography, the new generation of public key…
We consider three important and well-studied algorithmic problems in group theory: the word, geodesic, and conjugacy problem. We show transfer results from individual groups to graph products. We concentrate on logspace complexity because…
In this note, we lay the groundwork for a new approach to the problem of group-signature classification of group actions on closed Riemann surfaces. This new approach first focuses on analyzing the low level arithmetic conditions on…
Every smooth minimal complex algebraic surface of general type, $X$, may be mapped into a moduli space, $\MM_{c_1^2(X), c_2(X)}$, of minimal surfaces of general type, all of which have the same Chern numbers. Using the braid group and braid…
Braid groups may be defined for every Coxeter diagram. Artin's braid group is of type A. Analogs of Temperley-Lieb, Hecke and Birman-Wenzl algebras exist for B-type. Our general hypothethis is that the braid group of B-type replaces Artin's…
We explicitly construct an embedding of a right-angled Artin group into a classical pure braid group. Using this we obtain a number of corollaries describing embeddings of arbitrary Artin groups into right-angled Artin groups and linearly…
Polycyclic groups are natural generalizations of cyclic groups but with more complicated algorithmic properties. They are finitely presented and the word, conjugacy, and isomorphism decision problems are all solvable in these groups.…
We show a simple and easily implementable solution to the word problem for virtual braid groups.
In this paper, we propose two cryptosystems based on group rings and existing cryptosystem. First one is Elliptic ElGamal type group ring public key cryptosystem whose security is greater than security of cryptosystems based on elliptic…