Cryptanalysis of group-based key agreement protocols using subgroup distance functions

Dima Ruinskiy, Adi Shamir, Boaz Tsaban

We introduce a new approach for cryptanalysis of key agreement protocols based on noncommutative groups. This approach uses functions that estimate the distance of a group element to a given subgroup. We test it against the Shpilrain-Ushakov protocol, which is based on Thompson's group F.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment