A New Approach to the Conjugacy Problem in Garside Groups

Details A New Approach to the Conjugacy Problem in Garside Groups A New Approach to the Conjugacy Problem in Garside Groups

2003-06-12

arxiv.org/abs/math/0306199v2

Mathematics

Geometric Topology

Scientific paper

The cycling operation endows the super summit set $S_x$ of any element $x$ of a Garside group $G$ with the structure of a directed graph $\Gamma_x$. We establish that the subset $U_x$ of $S_x$ consisting of the circuits of $\Gamma_x$ can be used instead of $S_x$ for deciding conjugacy to $x$ in $G$, yielding a faster and more practical solution to the conjugacy problem for Garside groups. Moreover, we present a probabilistic approach to the conjugacy search problem in Garside groups. The results are likely to have implications for the security of recently proposed cryptosystems based on the hardness of problems related to the conjugacy (search) problem in braid groups.

Affiliated with

Also associated with

No associations

Rating

A New Approach to the Conjugacy Problem in Garside Groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A New Approach to the Conjugacy Problem in Garside Groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A New Approach to the Conjugacy Problem in Garside Groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-408354