Cryptanalysis of Group-Based Key Agreement Protocols Using Subgroup Distance Functions

Abstract. We introduce a new approach for cryptanalysis of key agreement protocols based on noncommutative groups. Our 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, and show that it can break about half the keys within a few seconds on a single PC.

• Type: Conference
• Year: 2007
• Where: PKC
• Authors: Dima Ruinskiy, Adi Shamir, Boaz Tsaban
• Keywords: Approach Uses Functions, Cryptography, Key Agreement Protocols, PKC 2007, Thompson’s Group F