Computation of Centralizers in Braid groups and Garside Groups
几何拓扑
2007-05-23 v2 群论
摘要
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.
关键词
引用
@article{arxiv.math/0201243,
title = {Computation of Centralizers in Braid groups and Garside Groups},
author = {Nuno Franco and Juan Gonzalez-Meneses},
journal= {arXiv preprint arXiv:math/0201243},
year = {2007}
}
备注
The algorithm has been improved by using the Summit Class, instead of the conjugacy class of the element under study. The word "normalizer" has been replaced by "centralizer". 14 pages, 4 figures