A New Key Exchange Protocol on Thompson Groups

By analyzing a key agreement protocol based on conjugacy and discrete logarithm problems proposed by Sakalauskas et al., we find that this protocol is vulnerable to linear attack. Then, an improved protocol on Thompson groups is proposed. The security of the new protocol is guaranteed by the uniqueness of inverse elements of a group, hiding property of hash function, discrete logarithm problem, and conjugacy search problem.