2000 character limit reached
Cryptanalysis of group-based key agreement protocols using subgroup distance functions
Published 20 May 2007 in cs.CR | (0705.2862v2)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
