Cryptanalysis of group-based key agreement protocols using subgroup distance functions
classification
💻 cs.CR
keywords
agreementapproachcryptanalysisdistancefunctionsgroupprotocolssubgroup
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.