LENGTH-BASED CONJUGACY SEARCH IN THE BRAID GROUP

which possesses sig-ni cantly better properties than the natural length associated tothe Garside normal form. We give experimental results concern-ing the success probability of this approach, which suggest that anunfeasible computational power is required for this method to suc-cessfully solve the Generalized Conjugacy Search Problem whenits parameters are as in existing protocols.