Some cryptographic protocols are based on the hardness of the problem
of drawing roots of elements in braid groups. We give a heuristic
approach to that problem and show that experimental results indicate
that our algorithm works with high probability for the suggested
parameters.