arXiv · math/0201243
Computation of Centralizers in Braid groups and Garside Groups
Abstract
We give a new method to compute the centralizer of an element in Artin braid groups and, more generally, in Garside groups. This method, together with the solution of the conugacy problem given by the authors in a previous paper, are two main steps for solving conjugacy systems, thus breaking recently discovered cryptosystems based in braid groups. We also present the result of our computations, where we notice that our algorithm yields surprisingly small generating sets for the centralizers.
Explore related subjects
Keep this discovery
Nuno Franco, Juan Gonzalez-Meneses. 2002-12-10. Computation of Centralizers in Braid groups and Garside Groups. https://arxiv.org/abs/math/0201243
Cite the original work for its findings. Save a collection to share your selection of sources.