Length-based conjugacy search in the Braid group

Details Length-based conjugacy search in the Braid group Length-based conjugacy search in the Braid group

2002-09-20

arxiv.org/abs/math/0209267v5

Contemporary Mathematics 418 (2006), 75--87

Mathematics

Group Theory

Small updates

Scientific paper

Several key agreement protocols are based on the following "Generalized Conjugacy Search Problem": Find, given elements b_1,...,b_n and xb_1x^{-1},...,xb_nx^{-1} in a nonabelian group G, the conjugator x. In the case of subgroups of the braid group B_N, Hughes and Tannenbaum suggested a length-based approach to finding x. Since the introduction of this approach, its effectiveness and successfulness were debated. We introduce several effective realizations of this approach. In particular, a new length function is defined on B_N which possesses significantly better properties than the natural length associated to the Garside normal form. We give experimental results concerning the success probability of this approach, which suggest that very large computational power is required for this method to successfully solve the Generalized Conjugacy Search Problem when its parameters are as in existing protocols.

Affiliated with

Also associated with

No associations

Rating

Length-based conjugacy search in the Braid group 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 Length-based conjugacy search in the Braid group, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Length-based conjugacy search in the Braid group will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-224504