Improving an algorithm to solve Multiple Simultaneous Conjugacy Problems in braid groups

Details Improving an algorithm to solve Multiple Simultaneous Conjugacy Problems in braid groups Improving an algorithm to solve Multiple Simultaneous Conjugacy Problems in braid groups

2002-12-10

arxiv.org/abs/math/0212150v1

Mathematics

Geometric Topology

9 pages

Scientific paper

There are recent cryptographic protocols that are based on Multiple
Simultaneous Conjugacy Problems in braid groups. We improve an algorithm, due
to Sang Jin Lee and Eonkyung Lee, to solve these problems, by applying a method
developed by the author and Nuno Franco, originally intended to solve the
Conjugacy Search Problem in braid groups.

Affiliated with

Also associated with

No associations

Rating

Improving an algorithm to solve Multiple Simultaneous Conjugacy Problems in braid 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 Improving an algorithm to solve Multiple Simultaneous Conjugacy Problems in braid groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improving an algorithm to solve Multiple Simultaneous Conjugacy Problems in braid groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-75271