{
  "id": "math/0306199",
  "version": "v2",
  "published": "2003-06-12T07:09:20.000Z",
  "updated": "2003-10-21T01:34:02.000Z",
  "title": "A New Approach to the Conjugacy Problem in Garside Groups",
  "authors": [
    "Volker Gebhardt"
  ],
  "categories": [
    "math.GT",
    "math.GR"
  ],
  "abstract": "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.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2003-10-21T01:34:02.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "20F36",
      "20F10"
    ],
    "keywords": [
      "garside group",
      "conjugacy problem",
      "conjugacy search problem",
      "super summit set",
      "braid groups"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2003math......6199G"
    }
  }
}