Cryptanalysis of group-based key agreement protocols using subgroup distance functions
Ruinskiy, Dima · Shamir, Adi · Tsaban, Boaz
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.